Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
SpringerLink
Log in

Cycle lengths in sparse graphs

  • Published:
Combinatorica 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

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. N. Alon, M. Krivelevich and B. Sudakov: Turán numbers of bipartite graphs and related Ramsey-type questions, Combinatorics, Probability and Computing 12 (2003), 477–494.

    Article  MATH  MathSciNet  Google Scholar 

  2. N. Alon, L. Rónyai and T. Szabó: Norm-graphs: variations and applications, J. Combinatorial Theory Ser. B 76 (1999), 280–290.

    Article  MATH  Google Scholar 

  3. B. Bollobás: Cycles modulo k, Bull. London Math. Soc. 9 (1977), 97–98.

    Article  MATH  MathSciNet  Google Scholar 

  4. B. Bollobás and A. Thomason: Weakly pancyclic graphs, J. Combinatorial Theory Ser. B 77 (1999), 121–137.

    Article  MATH  Google Scholar 

  5. A. Bondy: Pancyclic graphs I, J. Combinatorial Theory Ser. B 11 (1971), 80–84.

    Article  MATH  MathSciNet  Google Scholar 

  6. A. Bondy and M. Simonovits: Cycles of even length in graphs, J. Combinatorial Theory Ser. B 16 (1974), 97–105.

    Article  MATH  MathSciNet  Google Scholar 

  7. M. N. Ellingham and D. K. Menser: Girth, minimum degree, and circumference; J. Graph Theory 34(3) (2000), 221–233.

    Article  MATH  MathSciNet  Google Scholar 

  8. P. Erdős: Some of my favourite problems in various branches of combinatorics, Matematiche (Catania) 47 (1992), 231–240.

    MathSciNet  Google Scholar 

  9. P. Erdős: Some of my favorite solved and unsolved problems in graph theory, Quaestiones Math. 16 (1993), 333–350.

    MathSciNet  Google Scholar 

  10. P. Erdős: Some old and new problems in various branches of combinatorics, in: Graphs and combinatorics, (Marseille, 1995); also: Discrete Mathematics 165–166(15) (1997), 227–231.

  11. P. Erdős, R. Faudree, C. Rousseau and R. Schelp: The number of cycle lengths in graphs of given minimum degree and girth, Discrete Mathematics 200 (1999), 55–60.

    Article  MathSciNet  Google Scholar 

  12. G. Fan: Distribution of cycle lengths in graphs, J. Combinatorial Theory Ser. B 84 (2002), 187–202.

    Article  MATH  Google Scholar 

  13. R. Gould, P. Haxell and A. Scott: A note on cycle lengths in graphs, Graphs and Combinatorics 18 (2002), 491–498.

    Article  MATH  MathSciNet  Google Scholar 

  14. A. Gyárfás: Graphs with κ odd cycle lengths, Discrete Mathematics 103 (1992), 41–48.

    Article  MATH  MathSciNet  Google Scholar 

  15. A. Gyárfás, J. Komlós and E. Szemerédi: On the distribution of cycle lengths in graphs, J. Graph Theory 8 (1984), 441–462.

    Article  MATH  MathSciNet  Google Scholar 

  16. J. Kollár, L. Rónyai and T. Szabó: Norm-graphs and bipartite Turán numbers, Combinatorica 16(3) (1996), 399–406.

    Article  MATH  MathSciNet  Google Scholar 

  17. T. Kővári, V. T. Sós and P. Turán: On a problem of K. Zarankiewicz, Colloquium Math. 3 (1954), 50–57.

    MathSciNet  Google Scholar 

  18. L. Lovász: Combinatorial Problems and Exercises, 2nd Ed., North-Holland, Amsterdam, 1993.

    MATH  Google Scholar 

  19. A. Lubotzky, R. Phillips and P. Sarnak: Ramanujan Graphs, Combinatorica 8(3) (1988), 261–277.

    Article  MATH  MathSciNet  Google Scholar 

  20. G. Margulis: Explicit group-theoretic constructions of combinatorial schemes and their applications in the construction of expanders and concentrators, Problems Inform. Transmission 24 (1988), 39–46.

    MATH  MathSciNet  Google Scholar 

  21. O. Ore: On a graph theorem by Dirac, J. Combinatorial Theory 2 (1967), 383–392.

    Article  MATH  MathSciNet  Google Scholar 

  22. L. Pósa: Hamiltonian circuits in random graphs, Discrete Mathematics 14 (1976), 359–364.

    Article  MATH  MathSciNet  Google Scholar 

  23. J. Verstraëte: On arithmetic progressions of cycle lengths in graphs, Combinatorics Probability and Computing 9 (2000), 369–373.

    Article  MATH  MathSciNet  Google Scholar 

  24. C. Q. Zhang: Circumference and girth, J. Graph Theory 13(4) (1989), 485–490.

    Article  MathSciNet  Google Scholar 

  25. B. Z. Zhao: The circumference and girth of a simple graph (Chinese), J. Northeast Univ. Tech. 13(3) (1992), 294–296.

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of California, Los Angeles, Los Angeles, CA, 90095, USA

    Benny Sudakov

  2. Department of Mathematics, University of California, San Diego, 9500 Gilman Drive, La Jolla, CA, 92093-0112, USA

    Jacques Verstraëte

Authors
  1. Benny Sudakov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jacques Verstraëte
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Benny Sudakov.

Additional information

Research supported in part by NSF CAREER award DMS-0546523, NSF grant DMS-0355497, USA-Israeli BSF grant, Alfred P. Sloan fellowship, and the State of New Jersey.

Research supported by an Alfred P. Sloan Fellowship.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sudakov, B., Verstraëte, J. Cycle lengths in sparse graphs. Combinatorica 28, 357–372 (2008). https://doi.org/10.1007/s00493-008-2300-6

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00493-008-2300-6

Mathematics Subject Classification (2000)

Search

Navigation