2 papers
math.CO2026
Spanning tight components in 4-uniform hypergraphs
Francesco Di Braccio, Brian Hearn, Joanna Lada +2
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…
math.CO2025
Robustness of the Sauer-Spencer Theorem
Peter Allen, Julia Böttcher, Yoshiharu Kohayakawa +1
We prove a robust version of a graph embedding theorem of Sauer and Spencer. To state this sparser analogue, we define to be a random subgraph of obtained by retaining e…