Rémi de Joannis de Verclos

activity

20132022

most citedColouring triangle-free graphs with local list sizes

24 citations · 26 across the 7 of their papers we have counts for

collaborators

Showing 2018Show all

4 papers · 1 filter

math.CO2018

Occupancy fraction, fractional colouring, and triangle fraction

Ewan Davies, Rémi de Joannis de Verclos, Ross J. Kang +1

Given $ε > 0$ , there exists $f_{0}$ such that, if $f_{0} \leq f \leq Δ^{2} + 1$ , then for any graph $G$ on $n$ vertices of maximum degree $Δ$ in which the neighbourhood of every vert…

math.CO2018★ 24 cited

Colouring triangle-free graphs with local list sizes

Ewan Davies, Rémi de Joannis de Verclos, Ross J. Kang +1

We prove two distinct and natural refinements of a recent breakthrough result of Molloy (and a follow-up work of Bernshteyn) on the (list) chromatic number of triangle-free graphs.…

math.CO2018

Limits of Order Types

Xavier Goaoc, Alfredo Hubard, Rémi de Joannis de Verclos +2

We apply ideas from the theory of limits of dense combinatorial structures to study order types, which are combinatorial encodings of finite point sets. Using flag algebras we obta…

math.CO2018

Bipartite induced density in triangle-free graphs

Wouter Cames van Batenburg, Rémi de Joannis de Verclos, Ross J. Kang +1

We prove that any triangle-free graph on $n$ vertices with minimum degree at least $d$ contains a bipartite induced subgraph of minimum degree at least $d^{2} / (2 n)$ . This is sharp up…