Rémi de Joannis de Verclos

activity

20162026

most citedAn improved procedure for colouring graphs of bounded local density

16 citations · 16 across the 3 of their papers we have counts for

collaborators

6 papers

math.CO2026

Strong edge-colouring via local flag algebras

Eoin Davey, Eoin Hurley, Rémi de Joannis de Verclos +2

The strong chromatic index $χ_{s}^{'} (G)$ is the smallest number of colours needed to colour the edges of a graph $G$ so that any two edges at distance at most $2$ receive different col…

math.CO2026

Local flag algebras

Eoin Davey, Eoin Hurley, Rémi de Joannis de Verclos +2

We introduce local flag algebras, a variant of Razborov's flag algebra framework in which densities are normalised by the maximum degree $Δ (G)$ rather than the order $∣ G ∣$ . The fra…

math.CO2020★ 16 cited

An improved procedure for colouring graphs of bounded local density

Eoin Hurley, Rémi de Joannis de Verclos, Ross J. Kang

We develop an improved bound for the chromatic number of graphs of maximum degree $Δ$ under the assumption that the number of edges spanning any neighbourhood is at most $(1-σ)\bin…

math.CO2017

Exact distance coloring in trees

Nicolas Bousquet, Louis Esperet, Ararat Harutyunyan +1

For an integer $q \geq 2$ and an even integer $d$ , consider the graph obtained from a large complete $q$ -ary tree by connecting with an edge any two vertices at distance exactly $d$ …

math.CO2017

Additive bases and flows in graphs

Louis Esperet, Rémi de Joannis de Verclos, Tien-Nam Le +1

It was conjectured by Jaeger, Linial, Payan, and Tarsi in 1992 that for any prime number $p$ , there is a constant $c$ such that for any $n$ , the union (with repetition) of the vect…

math.CO2016

Colouring squares of claw-free graphs

Rémi de Joannis de Verclos, Ross J. Kang, Lucas Pastor

Is there some absolute $ε > 0$ such that for any claw-free graph $G$ , the chromatic number of the square of $G$ satisfies $χ (G^{2}) \leq (2 - ε) ω (G)^{2}$ , where $ω(G)…