activity
20102021
most citedMonotone cellular automata in a random environment

61 citations · 110 across the 13 of their papers we have counts for

collaborators

16 papers

math.CO2021

Rectilinear approximation and volume estimates for hereditary bodies via [0,1]-decorated containers

Victor Falgas-Ravry, Robert Hancock, Johanna Strömberg +1

We use the hypergraph container theory of Balogh--Morris--Samotij and Saxton--Thomason to obtain general rectilinear approximations and volume estimates for sequences of bodies clo…

math.CO2018★ 1 cited

Stability and Erdős--Stone type results for -free graphs with a fixed number of edges

Jamie Radcliffe, Andrew Uzzell

A fundamental problem of extremal graph theory is to ask, 'What is the maximum number of edges in an -free graph on vertices?' Recently Alon and Shikhelman proposed a more g…

math.CO2018★ 12 cited

On difference graphs and the local dimension of posets

Jinha Kim, Ryan R. Martin, Tomáš Masařík +4

The dimension of a partially-ordered set (poset), introduced by Dushnik and Miller (1941), has been studied extensively in the literature. Recently, Ueckerdt (2016) proposed a vari…

math.CO2018★ 1 cited

Multicolour containers, extremal entropy and counting

Victor Falgas-Ravry, Kelly O'Connell, Andrew Uzzell

In breakthrough results, Saxton-Thomason and Balogh-Morris-Samotij developed powerful theories of hypergraph containers. In this paper, we explore some consequences of these theori…

math.CO2017★ 3 cited

A simple discharging method for forbidden subposet problems

Ryan R. Martin, Abhishek Methuku, Andrew Uzzell +1

The poset consists of distinct elements , , \dots, , ,, such that ,~. The poset $Y'_{k+1…

math.CO2016★ 4 cited

Ore and Chvátal-type Degree Conditions for Bootstrap Percolation from Small Sets

Michael Dairyko, Michael Ferrara, Bernard Lidický +3

Bootstrap percolation is a deterministic cellular automaton in which vertices of a graph~ begin in one of two states, "dormant" or "active". Given a fixed integer , a dormant…