The Generalization of Dirac’s Theorem for Hypergraphs | Zendy

Endre Szemerédi | Zendy; Andrzej Ruciński | Zendy; Vojtěch Rödl | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

The Generalization of Dirac’s Theorem for Hypergraphs

Author(s) -

Endre Szemerédi,

Andrzej Ruciński,

Vojtěch Rödl

Publication year - 2005

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

ISBN - 3-540-28702-7

DOI - 10.1007/11549345_5

Subject(s) - counterexample , hamiltonian path , hamiltonian (control theory) , generalization , combinatorics , mathematics , vertex (graph theory) , discrete mathematics , perfect graph , graph theory , perfect graph theorem , graph , computer science , line graph , voltage graph , mathematical optimization , mathematical analysis , graph power

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research