Mathematics – Combinatorics
Scientific paper
2011-11-30
Mathematics
Combinatorics
13 pages
Scientific paper
We study sufficient conditions for Hamiltonian cycles in hypergraphs, and obtain both Tur\'an- and Dirac-type results. While the Tur\'an-type result gives an exact threshold for the appearance of a Hamiltonian cycle in a hypergraph depending only on the extremal number of a certain path, the Dirac-type result yields a sufficient condition relying solely on the minimum vertex degree.
Glebov Roman
Person Yury
Weps Wilma
No associations
LandOfFree
On extremal hypergraphs for hamiltonian cycles does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On extremal hypergraphs for hamiltonian cycles, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On extremal hypergraphs for hamiltonian cycles will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-6773