Skip to main content
Log in

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

  • Original Paper
  • Published:
Combinatorica Aims and scope Submit manuscript

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, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and 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

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00493-004-0017-8

Mathematics Subject Classification (2000):

Navigation