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

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

collaborators
Showing math.COShow all

2 papers · 1 filter

math.CO2025

Planar induced paths via a decomposition into non-crossing ordered graphs

Julien Duron, Hugo Jacob

In any graph, the maximum size of an induced path is bounded by the maximum size of a path. However, in the general case, one cannot find a converse bound, even up to an arbitrary…

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…