Induced Subdivisions In K s,s -Free Graphs of Large Average Degree

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.

This is a preview of subscription content, access via your institution.

Author information

Affiliations

Authors

Corresponding author

Correspondence to Daniela Kühn.

Rights and permissions

Reprints 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

Download citation

Mathematics Subject Classification (2000):

  • 05C35
  • 05D40