betaFeedback

WorksMathematics

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

Abstract

Let GG be the line graph of a 33-hypergraph, and let nn be its order. We prove that if GG is 33-connected, n≥4936n\ge4936, and δ(G)≥(n+5)/10δ(G)\ge(n+5)/10, then GG 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 33-connected claw-free graphs beyond the claw-free setting, since line graphs of 33-hypergraphs may contain induced claws. The coefficient 1/101/10 cannot be decreased, and the constant 55 in the numerator cannot be replaced by 44.

Paper details

vlnc:W_a9krets4
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 3

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

ChatGPT (OpenAI)

View statement
Looking for related papers…