1 citations · 2 across the 5 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
math.CO2026
A generalised transference principle
Peter Allen, Julia Böttcher, Joanna Lada +1
The last two decades have witnessed a growing trend towards proving sparse random analogues of combinatorial theorems. One unified approach to proving such theorems, formalised by…
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…