Skip to main content
SpringerLink
Log in

Subgraphs with large degrees and girth

  • Research Problems
  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

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

References

  1. Mader, W.: Existenz gewisser Konfigurationen inn-gesättigten Graphen und in Graphen genügend grosser Kantenichte. Math. Ann.194, 295–312 (1971)

    Article  MATH  MathSciNet  Google Scholar 

  2. Pyber, L., Rödl, V., Szemerédi, E.: Regular subgraphs in graphs with large average degree (to appear)

  3. Thomassen, C.: Girth in graphs. J. Comb. Theory (B)35, 129–141 (1983)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematics Institute, The Technical University of Denmark, Building 303, 2990, Lyngby, Denmark

    Carsten Thomassen

Authors
  1. Carsten Thomassen
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Thomassen, C. Subgraphs with large degrees and girth. Graphs and Combinatorics 1, 299–300 (1985). https://doi.org/10.1007/BF02582956

Download citation

  • Issue Date:

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

Keywords

Search

Navigation