Counting tight Hamilton cycles in Dirac hypergraphs

Felix Joos, Xinyue Xie

Suppose $G$ is a $k$-uniform hypergraph on $n$ vertices such that every $(k-1)$-subset $S$ of $V(G)$ belongs to at least $\delta n$ edges, where $\delta >1/2$. Let $\Psi (G)$ denote the number of…