8 citations · 61 across the 28 of their papers we have counts for
Showing 2015Show all
3 papers · 1 filter
math.CO2015
A Dichotomy Theorem for Circular Colouring Reconfiguration
Richard C. Brewster, Sean McGuinness, Benjamin Moore +1
The "reconfiguration problem" for circular colourings asks, given two -colourings and of a graph , is it possible to transform into by changing the colour…
math.CO2015
Weak regularity and finitely forcible graph limits
Jacob W. Cooper, Tomas Kaiser, Daniel Kral +1
Graphons are analytic objects representing limits of convergent sequences of graphs. Lovász and Szegedy conjectured that every finitely forcible graphon, i.e. any graphon determine…
math.CO2015★ 1 cited
Extremal Bounds for Bootstrap Percolation in the Hypercube
Natasha Morrison, Jonathan A. Noel
The -neighbour bootstrap percolation process on a graph starts with an initial set of "infected" vertices and, at each step of the process, a healthy vertex becomes in…