Work

A sharp minimum degree condition for Hamiltonicity in line graphs of 3-hypergraphs

Year: 2026
Type: preprint
Abstract: Let $G$ be the line graph of a $3$-hypergraph, and let $n$ be its order. We prove that if $G$ is $3$-connected, $n\ge4936$, and $δ(G)\ge(n+5)/10$, then $G$ 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 $3$-connected claw-free graphs beyond the claw-free setting, since line graphs of $3$-hypergraphs may contain induced claws. The coefficient $1/10$ cannot be decreased, and the constant $5$ in the numerator cannot be replaced by $4$.
Language: English
Open Access status: green
OpenAlex ID: W7236373944
Cites: 21
Cited by:
Related to: 10