22 citations · 112 across the 37 of their papers we have counts for
4 papers · 2 filters
Frozen -colourings of bounded degree graphs
Marthe Bonamy, Nicolas Bousquet, Guillem Perarnau
Let be a graph of maximum degree and be an integer. The -recolouring graph of is the graph whose vertices are -colourings of and where two -colourings…
A Rainbow Dirac's Theorem
Matthew Coulson, Guillem Perarnau
A famous theorem of Dirac states that any graph on vertices with minimum degree at least has a Hamilton cycle. Such graphs are called Dirac graphs. Strengthening this res…
On the number of coloured triangulations of -manifolds
Guillaume Chapuy, Guillem Perarnau
We give superexponential lower and upper bounds on the number of coloured -dimensional triangulations whose underlying space is an oriented manifold, when the number of simplice…
Rainbow factors in hypergraphs
Matthew Coulson, Peter Keevash, Guillem Perarnau +1
For any -graph , we consider the problem of finding a rainbow -factor in an -graph with large minimum -degree and an edge-colouring that is suitably bounded.…