Stéphan Thomassé

activity

20222026

most citedBounded twin-width graphs are polynomially

χ

-bounded

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

collaborators

Showing cs.DMShow all

2 papers · 1 filter

cs.DM2026

Ramsey Obstructions to Disambiguation

Romain Bourneuf, Antonin Kiladjian, Stéphan Thomassé

A partial matrix has entries in ${0, 1, ⋆}$ , and a disambiguation replaces each $⋆$ by $0$ or $1$ . We construct partial matrices whose fully specified submatrices satisfy s…

cs.DM2023★ 2 cited

Bounded twin-width graphs are polynomially $χ$ -bounded

Romain Bourneuf, Stéphan Thomassé

We show that every graph with twin-width $t$ has chromatic number $O (ω^{k_{t}})$ for some integer $k_{t}$ , where $ω$ denotes the clique number. This extends a quasi-polynomial bound fr…

Ramsey Obstructions to Disambiguation

Bounded twin-width graphs are polynomially χ-bounded

Bounded twin-width graphs are polynomially $χ$ -bounded