Counting Hamilton cycles in Dirac hypergraphs

Stefan Glock, Stephen Gould, Felix Joos +2

A tight Hamilton cycle in a $k$-uniform hypergraph ($k$-graph) $G$ is a cyclic ordering of the vertices of $G$ such that every set of $k$ consecutive vertices in the ordering forms…