Clément Legrand-Duchesne

activity

20222025

collaborators

4 papers

math.CO2025

A Recolouring Version of a Conjecture of Reed

Lucas De Meyer, Clément Legrand-Duchesne, Jared León +2

Reed conjectured that the chromatic number of any graph is closer to its clique number than to its maximum degree plus one. We consider a recolouring version of this conjecture, wi…

math.CO2025

Reconfiguration of square-tiled surfaces

Vincent Delecroix, Clément Legrand-Duchesne

We consider a combinatorial reconfiguration problem on a subclass of quadrangulations of surfaces called square-tiled surfaces. Our elementary move is a shear in a cylinder that co…

math.CO2024

Random embeddings of bounded degree trees with optimal spread

Paul Bastide, Clément Legrand-Duchesne, Alp Müyesser

A seminal result of Komlós, Sárközy, and Szemerédi states that any n-vertex graph G with minimum degree at least (1/2 + α)n contains every n-vertex tree T of bounded degree. Recent…

math.CO2022

Strengthening a theorem of Meyniel

Quentin Deschamps, Carl Feghali, František Kardoš +2

For an integer $k \geq 1$ and a graph $G$ , let $K_{k} (G)$ be the graph that has vertex set all proper $k$ -colorings of $G$ , and an edge between two vertices $α$ and~ $β$ whe…