Spanning tight components in 4-uniform hypergraphs

arXiv (Cornell University) 2026 Preprint Open access

Read full text
Authors: Francesco Di Braccio, Brian Hearn, Joanna Lada, Mihir Neve, Lu-Ming Zhang
DOI: 10.48550/arxiv.2602.23325
Cited by: 0

Abstract

We prove that every $n$-vertex 4-uniform hypergraph with minimum codegree at least $\lfloor n/4 \rfloor$ has a spanning tight component. This is tight, and it settles the 4-uniform case of a conjecture of Illingworth, Lang, Müyesser, Parczyk, and Sgueglia.

Fields of Study & Subjects

Limits and Structures in Graph Theory Advanced Combinatorial Mathematics Advanced Topology and Set Theory

Publication details

Journal / source
arXiv (Cornell University)
Publication date
26 February 2026
Language
EN
Document type
Preprint