We prove that for every graph H and for every s there exists d=d(H,s) such that every graph of average degree at least d contains either a K s,s as a subgraph or an induced subdivision of H.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Kühn, D., Osthus, D. Induced Subdivisions In K s,s -Free Graphs of Large Average Degree. Combinatorica 24, 287–304 (2004). https://doi.org/10.1007/s00493-004-0017-8
Received:
Issue Date:
DOI: https://doi.org/10.1007/s00493-004-0017-8