On Hamiltonian Berge cycles in $3$-uniform hypergraphs

Linyuan Lu, Zhiyu Wang

Given a set $R$, a hypergraph is $R$-uniform if the size of every hyperedge belongs to $R$. A hypergraph $\mathcal{H}$ is called \textit{covering} if every vertex pair is contained…