On Hamiltonian cycles in hypergraphs with dense link graphs (Q2040014)

A classical theorem of Dirac provides a sufficient condition for Hamiltonicity of a grap in terms of its minimal degree. In this paper, a Dirac-type condition is given for hypergraphs. Let \(H=(V,E)\), \(\left\vert V\right\vert =n,\) be a \(k\)-uniform hypergraph. Then \( H\) is said to be Hamiltonian if its vertices can be cyclically labelled such that \(\{x_{i},x_{i+1},\dots,x_{i+k-1}\}\in E\) for all \(i\in Z_{n}.\) For \(1\leq i<k,\) the \(i\)-th minimum degree of \(H\), \(\delta _{i}(H)\doteq \min \vert e\in H;S\subset e\vert ,\) where the minimum runs over all \( S\subset V,\left\vert S\right\vert =i.\) The authors prove that every \(k\)-uniform hypergraph on \(n\) vertices whose minimum \((k-2)\)-degree is at least \((5/9+o(1))\frac{n^{2}}{2}\) contains a Hamiltonian cycle. A construction due to \textit{J. Han} and \textit{Y. Zhao} [J. Comb. Theory, Ser. A 143, 107--115 (2016; Zbl 1342.05082)] shows that this minimum degree condition is optimal.