8 citations · 61 across the 28 of their papers we have counts for
Showing 2018Show all
3 papers · 1 filter
math.CO2018★ 6 cited
Reconfiguring Graph Homomorphisms on the Sphere
Jae-Baek Lee, Jonathan A. Noel, Mark Siggers
Given a loop-free graph , the reconfiguration problem for homomorphisms to (also called -colourings) asks: given two -colourings of of a graph , is it possi…
math.CO2018★ 2 cited
Finitely forcible graphons with an almost arbitrary structure
Daniel Kral, László Miklós Lovász, Jonathan A. Noel +1
Graphons are analytic objects representing convergent sequences of large graphs. A graphon is said to be finitely forcible if it is determined by finitely many subgraph densities,…
math.CO2018
A Sharp Threshold for Bootstrap Percolation in a Random Hypergraph
Natasha Morrison, Jonathan A. Noel
Given a hypergraph , the -bootstrap process starts with an initial set of infected vertices of and, at each step, a healthy vertex becom…