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.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
R. Aharoni, A. Georgakopoulos and P. Sprüssel, Perfect matchings in r-partite r-graphs, European J. Combin., 30(1) (2009), 39–42.
C. Berge, Nombres de coloration de l’hypergraphe /i-parti complet, Springer Lecture Notes4n Math., Vol. 411 (1975), 13–20.
J. C-Bermond et al., Hypergraphes hamiltoniens, Prob. Comb. Theorie Graph Orsay, 260 (1976), 39–43.
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.
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.
V. Chvátal, Linear Programming, W. H. Freeman, New York (1983)
D.E. Daykin and R. Häggkvist, Degrees giving independent edges in a hypergraph, Bull. Austral. Math. Soc, 23(1) (1981), 103–109.
G. A. Dirac, Some theorems of abstract graphs, Proc. London Math. Soc., 3 (1952), 69–81.
P. Frankl and V. Rödl, Near perfect coverings in graphs and hypergraphs, European J. Combin., 6(4) (1985), 317–326.
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.
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.
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.
G. Y. Katona and H. A. Kierstead, Hamiltonian chains in hypergraphs, J. Graph Theory, 30 (1999), 205–212.
D. Kühn, P. Keevash, R. Mycroft and D. Osthus, Loose Hamilton cycles in hypergraphs, submitted.
D. Kühn, R. Mycroft and D. Osthus, Hamilton l-cycles in k-graphs, J. of Combin. Theory, Ser. A, to appear.
D. Kühn and D. Osthus, Matchings in hypergraphs of large minimum degree, J. Graph Theory, 51 (2006), 269–280.
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.
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.
K. Markstrom and A. Ruciński, Perfect matchings and Hamilton cycles in hypergraphs with large degrees, submitted.
J. Moon and L. Moser, On Hamiltonian bipartite graphs, Israel J. Math., 1 (1963), 163–165.
O. Pikhurko, Perfect matchings and K4 3-tilings in hypergraphs of large codegree, Graphs Combin., 24(4) (2008), 391–404.
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.
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.
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.
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.
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.
V. Rödl, A. Ruciński and E. Szemerédi, Dirac-type conditions for hamiltonian paths and cycles in 3-uniform hypergraphs, submitted.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights 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
DOI: https://doi.org/10.1007/978-3-642-14444-8_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14443-1
Online ISBN: 978-3-642-14444-8
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)