Every Graph of Sufficiently Large Average Degree Contains a C 4-Free Subgraph of Large Average Degree

We prove that for every k there exists d=d(k) such that every graph of average degree at least d contains a subgraph of average degree at least k and girth at least six. This settles a special case of a conjecture of Thomassen.

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. Every Graph of Sufficiently Large Average Degree Contains a C 4-Free Subgraph of Large Average Degree. Combinatorica 24, 155–162 (2004). https://doi.org/10.1007/s00493-004-0010-2

Download citation

Mathematics Subject Classification (2000):

  • 05C35
  • 05D40