Skip to main content
SpringerLink
Log in

Subdivisions of a Graph of Maximal Degree n + 1 in Graphs of Average Degree and Large Girth

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

Dedicated to the memory of Paul Erdős

It is proved that for every finite graph H of maximal degree and every , there is an integer such that every finite graph of average degree at least and of girth at least contains a subdivision of H.

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. Institut für Mathematik, Universität Hannover; D-30167 Hannover, Germany; E-mail: mader@math.uni-hannover.de, , , , , , DE

    W. Mader

Authors
  1. W. Mader
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received May 5, 1999

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mader, W. Subdivisions of a Graph of Maximal Degree n + 1 in Graphs of Average Degree and Large Girth. Combinatorica 21, 251–265 (2001). https://doi.org/10.1007/s004930100023

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s004930100023

Search

Navigation