Romain Bourneuf

most citedA tamed family of triangle-free graphs with unbounded chromatic number

2 citations · 2 across the 2 of their papers we have counts for

collaborators

2 papers

math.CO2023

Factoring Pattern-Free Permutations into Separable ones

Édouard Bonnet, Romain Bourneuf, Colin Geniet +1

We show that for any permutation $π$ there exists an integer $k_{π}$ such that every permutation avoiding $π$ as a pattern is a product of at most $k_{π}$ separable permutations. In ot…

math.CO2023★ 2 cited

A tamed family of triangle-free graphs with unbounded chromatic number

Édouard Bonnet, Romain Bourneuf, Julien Duron +3

We construct a hereditary class of triangle-free graphs with unbounded chromatic number, in which every non-trivial graph either contains a pair of non-adjacent twins or has an edg…