activity
20112026
most citedLarge subgraphs without short cycles

22 citations · 112 across the 37 of their papers we have counts for

collaborators
Showing 2018Show all

7 papers · 1 filter

cs.DS2018

The Glauber dynamics for edge-colourings of trees

Michelle Delcourt, Marc Heinrich, Guillem Perarnau

Let be a tree on vertices and with maximum degree . We show that for the Glauber dynamics for -edge-colourings of mixes in polynomial time in . The…

math.CO2018

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…

cs.DS2018★ 2 cited

Improved Bounds for Randomly Sampling Colorings via Linear Programming

Sitan Chen, Michelle Delcourt, Ankur Moitra +2

A well-known conjecture in computer science and statistical physics is that Glauber dynamics on the set of -colorings of a graph on vertices with maximum degree is r…

math.CO2018★ 6 cited

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…

math.CO2018★ 5 cited

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…

cs.DM2018★ 4 cited

Rapid mixing of Glauber dynamics for colorings below Vigoda's threshold

Michelle Delcourt, Guillem Perarnau, Luke Postle

A well-known conjecture in computer science and statistical physics is that Glauber dynamics on the set of -colorings of a graph on vertices with maximum degree is r…