6 citations · 6 across the 5 of their papers we have counts for
11 papers
Shotgun assembly of random graphs
Tom Johnston, Gal Kronenberg, Alexander Roberts +1
In the graph shotgun assembly problem, we are given the balls of radius around each vertex of a graph and asked to reconstruct the graph. We study the shotgun assembly of the E…
Decomposing random permutations into order-isomorphic subpermutations
Carla Groenland, Tom Johnston, Dániel Korándi +3
Two permutations and are -similar if they can be decomposed into subpermutations and such that is order-isomorphic to f…
Isoperimetric stability in lattices
Ben Barber, Joshua Erde, Peter Keevash +1
We obtain isoperimetric stability theorems for general Cayley digraphs on . For any fixed that generates over , we characterise the app…
Exact stability for Turán's Theorem
Dániel Korándi, Alexander Roberts, Alex Scott
Turán's Theorem says that an extremal -free graph is -partite. The Stability Theorem of Erdős and Simonovits shows that if a -free graph with vertices has…
Shotgun reconstruction in the hypercube
Michał Przykucki, Alexander Roberts, Alex Scott
Mossel and Ross raised the question of when a random colouring of a graph can be reconstructed from local information, namely the colourings (with multiplicity) of balls of given r…
Parking on the integers
Michał Przykucki, Alexander Roberts, Alex Scott
Models of parking in which cars are placed randomly and then move according to a deterministic rule have been studied since the work of Konheim and Weiss in the 1960s. Recently, Da…