Abstract
In 1984, Thomassen conjectured that for every constant , there exists such that every graph with average degree at least contains a balanced subdivision of a complete graph on vertices, i.e., a subdivision in which each edge is subdivided the same number of times. Recently, Liu and Montgomery confirmed Thomassen’s conjecture. We show that for every constant , every graph with average degree at least contains a balanced subdivision of a complete graph of size at least . Note that this bound is almost optimal. Moreover, we show that every sparse expander with minimum degree at least contains a balanced subdivision of a complete graph of size at least .
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.
