8 citations · 61 across the 28 of their papers we have counts for
4 papers · 1 filter
Extremal Bounds for Three-Neighbour Bootstrap Percolation in Dimensions Two and Three
Peter J. Dukes, Jonathan A. Noel, Abel E. Romer
For , the -neighbour bootstrap process in a graph starts with a set of infected vertices and, in each time step, every vertex with at least infected neighbours b…
Common Pairs of Graphs
Natalie Behague, Natasha Morrison, Jonathan A. Noel
A graph is said to be common if the number of monochromatic labelled copies of in a red/blue edge colouring of a large complete graph is asymptotically minimized by a rando…
On the Running Time of Hypergraph Bootstrap Percolation
Jonathan A. Noel, Arjun Ranganathan
Given and an -uniform hypergraph , the -bootstrap process starts with an -uniform hypergraph and, in each time step, every hyperedge which "completes" a co…
Circle Squaring with Pieces of Small Boundary and Low Borel Complexity
András Máthé, Jonathan A. Noel, Oleg Pikhurko
Tarski's Circle Squaring Problem from 1925 asks whether it is possible to partition a disk in the plane into finitely many pieces and reassemble them via isometries to yield a part…