The Generalization of Dirac’s Theorem for Hypergraphs
A substantial amount of research in graph theory continues to concentrate on the existence of hamiltonian cycles and perfect matchings. A classic theorem of Dirac states that a sufficient condition for an n-vertex graph to be hamiltonian, and thus, for n even, to have a perfect matching, is that the minimum degree is at least n/2. Moreover, there are obvious counterexamples showing that this is best possible.
Unable to display preview. Download preview PDF.
- 7.Kuhn, D., Osthus, D.: Matchings in hypergraphs of large minimum degree (submited)Google Scholar
- 8.Lovász, L., Plummer, M.D.: Matching theory. North-Holland Mathematics Studies 121, Annals of Discrete Mathematics 29, North-Holland Publishing Co., Amsterdam; Akadémiai Kiadó, Budapest (1986)Google Scholar
- 9.Rödl, V., Ruciński, A., Szemerédi, E.: A Dirac-type theorem for 3-uniform hypergraphs, Combinatorics, Probability and Computing (to appear)Google Scholar
- 10.Rödl, V., Ruciński, A., Szemerédi, E.: Perfect matchings in uniform hypergraphs with large minimum degree (submitted)Google Scholar
- 11.Rödl, V., Ruciński, A., Szemerédi, E.: An approximative Dirac-type theorem for k-uniform hypergraphs (submitted)Google Scholar
- 12.Szemerédi, E.: Regular partitions of graphs. Problemes combinatoires et theorie des graphes (Colloq. Internat. CNRS, Univ. Orsay, Orsay, 1976), pp. 399–401, Colloq. Internat. CNRS, 260, CNRS, Paris (1978)Google Scholar