44 citations · 327 across the 39 of their papers we have counts for
4 papers · 1 filter
Extremal density for sparse minors and subdivisions
John Haslegrave, Jaehoon Kim, Hong Liu
We prove an asymptotically tight bound on the extremal density guaranteeing subdivisions of bounded-degree bipartite graphs with a mild separability condition. As corollaries, we a…
Time Dependent Biased Random Walks
John Haslegrave, Thomas Sauerwald, John Sylvester
We study the biased random walk where at each step of a random walk a "controller" can, with a certain small probability, move the walk to an arbitrary neighbour. This model was in…
Combinatorial universality in three-speed ballistic annihilation
John Haslegrave, Laurent Tournier
We consider a one-dimensional system of particles, moving at constant velocities chosen independently according to a symmetric distribution on , and annihilating upon…
Countable graphs are majority 3-choosable
John Haslegrave
The Unfriendly Partition Conjecture posits that every countable graph admits a 2-colouring in which for each vertex there are at least as many bichromatic edges containing that ver…