A Fan-Type Theorem for Hamiltonian Berge Cycles in 3-Uniform Hypergraphs
Let $H$ be a simple $3$-uniform hypergraph on $n\ge7$ vertices, and put $\tau_n=\binom{\lfloor(n-1)/2\rfloor}{2}$. We prove that $H$ has a Hamiltonian Berge cycle if its $2$-shadow is $2$-connected, every pair at Berge distance two has an endpoint of hypergraph degree at least $\tau_n+1$, and every pair of codegree one...