WorksMathematics
A sharp minimum degree condition for Hamiltonicity in line graphs of 3-hypergraphs
Abstract
Let be the line graph of a -hypergraph, and let be its order. We prove that if is -connected, , and , then is Hamiltonian if and only if it does not belong to an explicitly described family of exceptional graphs. This extends the sharp minimum degree bound of Lai, Shao, and Zhan for -connected claw-free graphs beyond the claw-free setting, since line graphs of -hypergraphs may contain induced claws. The coefficient cannot be decreased, and the constant in the numerator cannot be replaced by .