Dense Minors In Graphs Of Large Girth

Combinatorica volume 25, pages111–116(2004)Cite this article

We show that a graph of girth greater than 6 log k+3 and minimum degree at least 3 has a minor of minimum degree greater than k. This is best possible up to a factor of at most 9/4. As a corollary, every graph of girth at least 6 log r+3 log log r+c and minimum degree at least 3 has a K r minor.

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

Access options

Buy single article

Instant access to the full article PDF.

US$ 39.95

Tax calculation will be finalised during checkout.

Author information

Affiliations

  1. Mathematisches Seminar, Universität Hamburg, Bundesstraße 55, D-20146, Hamburg, Germany

    Reinhard Diestel

  2. Mathematisches Seminar, Universität Hamburg, Bundesstraße 55, D-20146, Hamburg, Germany

    Christof Rempel

Authors
  1. Reinhard Diestel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Christof Rempel
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Reinhard Diestel.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Diestel, R., Rempel, C. Dense Minors In Graphs Of Large Girth. Combinatorica 25, 111–116 (2004). https://doi.org/10.1007/s00493-005-0009-3

Download citation

Mathematics Subject Classification (2000):

  • 05C35
  • 05C83