Spanning tight components in 4-uniform hypergraphs
Abstract
We prove that every n-vertex 4-uniform hypergraph with minimum codegree at least n/4 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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.