Loose Hamilton cycles in hypergraphs

Details Loose Hamilton cycles in hypergraphs Loose Hamilton cycles in hypergraphs

2008-08-12

arxiv.org/abs/0808.1713v2

Mathematics

Combinatorics

new version which contains minor revisions and updates

Scientific paper

We prove that any k-uniform hypergraph on n vertices with minimum degree at least n/(2(k-1))+o(n) contains a loose Hamilton cycle. The proof strategy is similar to that used by K\"uhn and Osthus for the 3-uniform case. Though some additional difficulties arise in the k-uniform case, our argument here is considerably simplified by applying the recent hypergraph blow-up lemma of Keevash.

Affiliated with

Also associated with

No associations

Rating

Loose Hamilton cycles in hypergraphs 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 Loose Hamilton cycles in hypergraphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Loose Hamilton cycles in hypergraphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-203252