2025/05/16 by Richard Mycroft, Mycroft, Richard, Camila Zárate-Guerén +1 · 2 citations
Mathematics · #Combinatorics (math.CO) #FOS: Mathematics #Limits and Structures in Graph Theory #Markov Chains and Monte Carlo Methods #Tensor decomposition and applications
paper · pdf · doi:10.48550/arxiv.2505.11400
openalex publication_date 2025/05/16 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
For each k ≥ 3 and 1 ≤ ℓ ≤ k-1 we give an asymptotically best possible minimum positive codegree condition for the existence of a Hamilton ℓ-cycle in a k-uniform hypergraph. This result exhibits an interesting duality with its analogue under a minimum codegree condition. The special case ℓ = k-1 of our result establishes an asymptotic version of a recent conjecture of Illingworth, Lang, Müyesser, Parczyk and Sgueglia on tight Hamilton cycles in hypergraphs.