Showing 2025 · math.COShow all
2 papers · 2 filters
math.CO2025
Slow graph bootstrap percolation III: Chain constructions
David Fabian, Patrick Morris, Tibor Szabó
For graphs , we study the extremal function which is the maximum running time (until stabilisation) of an -bootstrap percolation process on vertices. Building on…
math.CO2025
A rainbow Dirac theorem for loose Hamilton cycles in hypergraphs
Amarja Kathapurkar, Patrick Morris, Guillem Perarnau
A meta-conjecture of Coulson, Keevash, Perarnau and Yepremyan states that above the extremal threshold for a given spanning structure in a (hyper-)graph, one can find a rainbow ver…