DM
2011
13 years 6 months ago
2011
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...