Skip to main content
SpringerLink
Log in

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

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

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

Access this article

Log in via an institution

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

  1. Freie Universität Berlin, Institut für Mathematik, Arnimallee 3, 14195, Berlin, Germany

    Daniela Kühn

  2. Institut für Informatik, Humboldt-Universität zu Berlin, Unter den Linden 6, D-10099, Berlin, Germany

    Deryk Osthus

Authors
  1. Daniela Kühn
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Deryk Osthus
    View author publications

    You can also search for this author in PubMed Google Scholar

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

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00493-004-0010-2

Mathematics Subject Classification (2000):

Search

Navigation