Abstract
AbstractWe show that there is a constant c so that for fixed r ≥ 3 a.a.s. an r‐regular graph on n vertices contains a complete graph on $ c\sqrt{n} $ vertices as a minor. This confirms a conjecture of Markström (Ars Combinatoria 70 (2004) 289–295). Since any minor of an r‐regular graph on n vertices has at most rn/2 edges, our bound is clearly best possible up to the value of the constant c. As a corollary, we also obtain the likely order of magnitude of the largest complete minor in a random graph Gn,p during the phase transition (i.e., when pn → 1). © 2009 Wiley Periodicals, Inc. Random Struct. Alg., 2009
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.
