Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree (Q859609)

A loose Hamiltonian cycle \({\mathcal C}\) in a \(3\)-uniform hypergraph \({\mathcal H}\) is a ordering of the vertices such that each pair of consecutive vertices is in a hyperedge and each such hyperedge contains \(3\) consecutive vertices of \({\mathcal C}\). It is shown for any \(\varepsilon > 0\) and \(n\) sufficiently large, that any hypergraph \({\mathcal H}\) of order \(n\) with minimum degree at least \(n/4 + \varepsilon n\) is Hamiltonian, and it also contains a perfect \({\mathcal C}_4\)-packing if \(n\) is divisible by \(4\). It is also shown for any \(\mu > 0\) that if the minimum degree is at least \(n/4 + \mu n\), then there is a perfect \({\mathcal C}_k\)-packing of \({\mathcal H}\) for any \(k \geq k_0 = k_0(\mu)\) if \(k\) divides \(n\).