Skip to main content
SpringerLink
Log in
Book cover

An Irregular Mind pp 561–590Cite as

Dirac-Type Questions For Hypergraphs — A Survey (Or More Problems For Endre To Solve)

  • Chapter

Part of the book series: Bolyai Society Mathematical Studies ((BSMS,volume 21))

Abstract

Dedicated to Endre Szemerédi on the occasion of his 70th birthday In 1952 Dirac [8] proved a celebrated theorem stating that if the minimum degree δ(G) in an n-vertex graph G is at least n/2 then G contains a Hamiltonian cycle. In 1999, Katona and Kierstead initiated a new stream of research devoted to studying similar questions for hypergraphs, and subsequently, for perfect matchings. A pivotal role in achieving some of the most important results in both these areas was played by Endre Szemerédi. In this survey we present the current state-of-art and pose some open problems.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Aharoni, A. Georgakopoulos and P. Sprüssel, Perfect matchings in r-partite r-graphs, European J. Combin., 30(1) (2009), 39–42.

    Article  MATH  MathSciNet  Google Scholar 

  2. C. Berge, Nombres de coloration de l’hypergraphe /i-parti complet, Springer Lecture Notes4n Math., Vol. 411 (1975), 13–20.

    Article  MathSciNet  Google Scholar 

  3. J. C-Bermond et al., Hypergraphes hamiltoniens, Prob. Comb. Theorie Graph Orsay, 260 (1976), 39–43.

    MathSciNet  Google Scholar 

  4. B. Bollobás, D.E. Daykin and P. Erdős, Sets of independent edges of a hypergraph, Quart. J. Math. Oxford Ser. (2), 27(105) (1976), 10525–32.

    Google Scholar 

  5. G. Chen, R. J. Faudree, R. J. Gould, M. S. Jacobson and L. Lesniak, Hamiltonicity in Balanced k-Partite Graphs, Graphs and Combinatorics, 11 (1995), 221–231.

    Article  MATH  MathSciNet  Google Scholar 

  6. V. Chvátal, Linear Programming, W. H. Freeman, New York (1983)

    MATH  Google Scholar 

  7. D.E. Daykin and R. Häggkvist, Degrees giving independent edges in a hypergraph, Bull. Austral. Math. Soc, 23(1) (1981), 103–109.

    Article  MATH  MathSciNet  Google Scholar 

  8. G. A. Dirac, Some theorems of abstract graphs, Proc. London Math. Soc., 3 (1952), 69–81.

    Article  MathSciNet  Google Scholar 

  9. P. Frankl and V. Rödl, Near perfect coverings in graphs and hypergraphs, European J. Combin., 6(4) (1985), 317–326.

    MATH  MathSciNet  Google Scholar 

  10. A. Gyárfás, G. Sárközy and E. Szemerédi, Monochromatic Hamiltonian 3-tight Berge cycles in 2-colored 4-uniform hypergraphs. Journal of Graph Theory, 63 (2010), 288–299.

    MATH  MathSciNet  Google Scholar 

  11. H. Hán, Y. Person and M. Schacht, On perfect matchings in uniform hypergraphs with large minimum vertex degree, SIAM J. Discrete Math., 23(2) (2009), 732–748.

    Article  MATH  MathSciNet  Google Scholar 

  12. H. Hán and M. Schacht, Dirac-type results for loose Hamilton cycles in uniform hypergraphs, J. of Combin. Theory, Ser. B, 100(3) (2010), 332–346.

    Article  MATH  Google Scholar 

  13. G. Y. Katona and H. A. Kierstead, Hamiltonian chains in hypergraphs, J. Graph Theory, 30 (1999), 205–212.

    Article  MATH  MathSciNet  Google Scholar 

  14. D. Kühn, P. Keevash, R. Mycroft and D. Osthus, Loose Hamilton cycles in hypergraphs, submitted.

    Google Scholar 

  15. D. Kühn, R. Mycroft and D. Osthus, Hamilton l-cycles in k-graphs, J. of Combin. Theory, Ser. A, to appear.

    Google Scholar 

  16. D. Kühn and D. Osthus, Matchings in hypergraphs of large minimum degree, J. Graph Theory, 51 (2006), 269–280.

    Article  MATH  MathSciNet  Google Scholar 

  17. D. Kühn and D. Osthus, Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree, J. Combin. Theory, Ser. B, 96(6) (2006), 767–821.

    Article  MATH  MathSciNet  Google Scholar 

  18. L. Lovász & M. D. Plummer, Matching theory, North-Holland Mathematics Studies 121, Annals of Discrete Mathematics 29, North-Holland Publishing Co., Amsterdam; Akadémiai Kiadó, Budapest, 1986.

    Google Scholar 

  19. K. Markstrom and A. Ruciński, Perfect matchings and Hamilton cycles in hypergraphs with large degrees, submitted.

    Google Scholar 

  20. J. Moon and L. Moser, On Hamiltonian bipartite graphs, Israel J. Math., 1 (1963), 163–165.

    Article  MATH  MathSciNet  Google Scholar 

  21. O. Pikhurko, Perfect matchings and K4 3-tilings in hypergraphs of large codegree, Graphs Combin., 24(4) (2008), 391–404.

    Article  MATH  MathSciNet  Google Scholar 

  22. V. Rödl, A. Ruciński and E. Szemerédi, A Dirac-type theorem for 3-uniform hypergraphs Combin. Probab. Comput., 15(1-2) (2006), 229–251.

    Article  MATH  Google Scholar 

  23. V. Rödl, A. Ruciński and E. Szemerédi, Perfect matchings in uniform hypergraphs with large minimum degree, Europ. J. Combin., 27 (2006), 1333–1349.

    Article  MATH  Google Scholar 

  24. V. Rödl, A. Ruciński and E. Szemerédi, An approximate Dirac-type theorem for it-uniform hypergraphs, Combinatorica, 28(2) (2008), 229–260.

    Article  MATH  MathSciNet  Google Scholar 

  25. V. Rödl, A. Ruciński, M. Schacht and E. Szemerédi, A note on perfect matchings in uniform hypergraphs with large minimum collective degree, Commentationes Mathematicae Universitatis Carolinae, 49(4) (2008), 633–636.

    MATH  MathSciNet  Google Scholar 

  26. V. Rödl, A. Rucinski and E. Szemerédi, Perfect matchings in large uniform hypergraphs with large minimum collective degree, J. Combin. Theory, Ser. A, 116 (2009), 613–636.

    Article  MATH  MathSciNet  Google Scholar 

  27. V. Rödl, A. Ruciński and E. Szemerédi, Dirac-type conditions for hamiltonian paths and cycles in 3-uniform hypergraphs, submitted.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Emory University, Atlanta, GA

    Vojtech Rödl

  2. A. Mickiewicz University, Poznan, Poland

    Andrzej RuciŃski

Authors
  1. Vojtech Rödl
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andrzej RuciŃski
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Vojtech Rödl .

Editor information

Editors and Affiliations

  1. Alfred Rènyi Institute of Mathematics, Hungarian Academy of Sciences, Reáltanoda u. 13-15, Budapest, 1053, Hungary

    Imre Bárány

  2. Department of Mathematics, University of British Columbia, Mathematics Road 1984, V6T 1Z2, Vancouver, British Columbia, Canada

    József Solymosi

  3. Alfred Rènyi Institute of Mathematics, Hungarian Academy of Sciences, Reáltanoda u. 13-15, Budapest, 1053, Hungary

    Gábor Sági

Rights and permissions

Reprints and permissions

Copyright information

© 2010 János Bolyai Mathematical Society and Springer-Verlag

About this chapter

Cite this chapter

Rödl, V., RuciŃski, A. (2010). Dirac-Type Questions For Hypergraphs — A Survey (Or More Problems For Endre To Solve). In: Bárány, I., Solymosi, J., Sági, G. (eds) An Irregular Mind. Bolyai Society Mathematical Studies, vol 21. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14444-8_16

Download citation

Publish with us

Policies and ethics

Search

Navigation