On extremal hypergraphs for hamiltonian cycles

Mathematics – Combinatorics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

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.

Rate now

     

Profile ID: LFWR-SCP-O-6773

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.