Clément Legrand-Duchesne

collaborators

4 papers

math.CO2026

Dirac's theorem and the switch geometry of perfect matchings

Ross J. Kang, ClÃ©ment Legrand-Duchesne

Let $G$ be a graph on an even number $n$ of vertices and let $M_{G}$ be the collection of perfect matchings in $G$ . Dirac's theorem says that if the minimum degree $I^´ (G)$ of…

math.CO2026

A Gray code for arborescences of tournaments

Marthe Bonamy, Michael Hoffmann, ClÃ©ment Legrand-Duchesne +1

We consider the following question of Knuth: given a directed graph $G$ and a root $r$ , can the arborescences of $G$ rooted in $r$ be listed such that any two consecutive arboresce…

math.CO2026

A coarse Gallai theorem

Marc Distel, Ugo Giocanti, JÄdrzej Hodor +2

We prove that there exist functions $f$ and $g$ such that for all positive integers $k$ and $d$ , for every graph $G$ and every subset $A$ of the vertices of $G$ , either $G$ contain…

math.CO2024

The structure of quasi-transitive graphs avoiding a minor with applications to the domino problem

An infinite graph is quasi-transitive if its vertex set has finitely many orbits under the action of its automorphism group. In this paper we obtain a structure theorem for locally…