12 citations · 19 across the 3 of their papers we have counts for
3 papers
math.CO2016★ 12 cited
Multicolour containers and the entropy of decorated graph limits
Victor Falgas-Ravry, Kelly O'Connell, Johanna Strömberg +1
In recent breakthrough results, Saxton--Thomason and Balogh--Morris--Samotij have developed powerful theories of hypergraph containers. These theories have led to a large number of…
math.CO2014
Strong Turán stability
Mykhaylo Tyomkyn, Andrew J. Uzzell
We study the behaviour of -free graphs of almost extremal size, that is, typically, . We show that such graphs must have a large amount of 'sy…
math.CO2012★ 7 cited
The time of bootstrap percolation for dense initial sets
Béla Bollobás, Cecilia Holmgren, Paul Smith +1
In r-neighbour bootstrap percolation on the vertex set of a graph G, vertices are initially infected independently with some probability p. At each time step, the infected set expa…