2010 | OriginalPaper | Buchkapitel
Dirac-Type Questions For Hypergraphs — A Survey (Or More Problems For Endre To Solve)
verfasst von : Vojtech Rödl, Andrzej RuciŃski
Erschienen in: An Irregular Mind
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.