Skip to main content
SpringerLink
Log in

Graphs without proper subgraphs of minimum degree 3 and short cycles

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

Abstract

We study graphs on n vertices which have 2n−2 edges and no proper induced subgraphs of minimum degree 3. Erdős, Faudree, Gyárfás, and Schelp conjectured that such graphs always have cycles of lengths 3,4,5,...,C(n) for some function C(n) tending to in finity. We disprove this conjecture, resolve a related problem about leaf-to-leaf path lengths in trees, and characterize graphs with n vertices and 2n−2 edges, containing no proper subgraph of minimum degree 3.

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

References

  1. B. Bollobás: Modern Graph Theory, Springer, (1998).

    Book  MATH  Google Scholar 

  2. B. Bollobás and G. Brightwell: Long cycles in graphs with no subgraphs of minimal degree 3, Discrete Math. 75 (1989), 47–53.

    Article  MathSciNet  MATH  Google Scholar 

  3. P. Erdős, R. J. Faudree, A. Gyárfás and R. H. Schelp: Cycles in graphs without proper subgraphs of minimum degree 3, Ars Combin. 25(B) (1988), 159–201.

    MathSciNet  MATH  Google Scholar 

  4. P. Erdős, R. J. Faudree, C. Rousseau and R. H. Schelp: Subgraphs of minimal degree k, Discrete Math., 85(1) (1990), 53–58.

    Article  MathSciNet  MATH  Google Scholar 

  5. G. Laman: On graphs and the rigidity of plane skeletal structures, J. Engrg. Math. 4 (1970), 331–340.

    Article  MathSciNet  MATH  Google Scholar 

  6. A. Lehman: A solution of the Shannon switching game, J. Soc. Indust. Appl. 12 (1964), 687–725.

    Article  MathSciNet  MATH  Google Scholar 

  7. C. Nash-Williams: Edge disjoint spanning trees of finite graphs, J. London Math. Soc. 36 (1961), 445–450.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Freie Universität, Berlin, Germany

    Lothar Narins, Alexey Pokrovskiy & Tibor Szabó

Authors
  1. Lothar Narins
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alexey Pokrovskiy
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Tibor Szabó
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Research supported by the Research Training Group Methods for Discrete Structures and the Berlin Mathematical School.

Research supported by the Research Training Group Methods for Discrete Structures.

Research partially supported by DFG within the Research Training Group Methods for Discrete Structures.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Narins, L., Pokrovskiy, A. & Szabó, T. Graphs without proper subgraphs of minimum degree 3 and short cycles. Combinatorica 37, 495–519 (2017). https://doi.org/10.1007/s00493-015-3310-9

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00493-015-3310-9

Mathematics Subject Classification (2000)

Search

Navigation