5 papers · 1 filter
A local limit theorem for the edge counts of random induced subgraphs of a random graph
Paul Balister, Emil Powierski, Alex Scott +1
Consider a `dense' Erdős--Rényi random graph model with vertices and edges, where we assume the edge density is bounded away from 0 and 1. Fix…
A note on graphs of -colourings
Emma Hogan, Alex Scott, Youri Tamitegama +1
For a graph , the -colouring graph of has vertices corresponding to proper -colourings of and edges between colourings that differ at a single vertex. The graph su…
Reconstruction of shredded random matrices
Paul Balister, Gal Kronenberg, Alex Scott +1
A matrix is given in ``shredded'' form if we are presented with the multiset of rows and the multiset of columns, but not told which row is which or which column is which. The matr…
Graphs with arbitrary Ramsey number and connectivity
Isabel Ahme, Alex Scott
The Ramsey number of a graph is the minimum number such that any red-blue colouring of the edges of contains a monochromatic copy of . Pavez-Signé, Piga and…
Boundary rigidity of 3D CAT(0) cube complexes
John Haslegrave, Alex Scott, Youri Tamitegama +1
The boundary rigidity problem is a classical question from Riemannian geometry: if is a Riemannian manifold with smooth boundary, is the geometry of determined up to i…