Finding tight Hamilton cycles in random hypergraphs faster

Peter Allen, Christoph Koch, Olaf Parczyk +1

In an $r$-uniform hypergraph on $n$ vertices a tight Hamilton cycle consists of $n$ edges such that there exists a cyclic ordering of the vertices where the edges correspond to con…