Abstract
Random graphs have the smallest complete minors among all graphs of given order and density. We show that, unlike random graphs, many well-known examples of pseudorandom graphs (such as Paley graphs) have very large minors. © 2000 John Wiley & Sons, Inc. Random Struct. Alg., 17: 26–28, 2000
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
