Spanning tight components in 4-uniform hypergraphs
Combinatorics
2026-02-27 v1
Abstract
We prove that every -vertex 4-uniform hypergraph with minimum codegree at least has a spanning tight component. This is tight, and it settles the 4-uniform case of a conjecture of Illingworth, Lang, M\"uyesser, Parczyk, and Sgueglia.
Keywords
Cite
@article{arxiv.2602.23325,
title = {Spanning tight components in 4-uniform hypergraphs},
author = {Francesco Di Braccio and Brian Hearn and Joanna Lada and Mihir Neve and Lu-Ming Zhang},
journal= {arXiv preprint arXiv:2602.23325},
year = {2026}
}
Comments
24 pages, 4 figures