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 2026Show all

3 papers · 1 filter

math.CO2026

Asymmetric Homomorphism Thresholds for Graphs of Large Odd Girth

Romain Bourneuf, Raphael Steiner, Stéphan Thomassé +1

We determine the asymmetric homomorphism threshold from graphs of odd girth at least $7$ to triangle-free graphs, showing that $δ_{hom} ({C_{3}, C_{5}}, {C_{3}}) = \frac{1}{9}$ .…

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.DS2026

A combinatorial framework for clustering graph states: Algorithms and hardness for rank-integrity

Romain Bourneuf, Nathan Claudet, Sang Yoon Kim +3

We introduce a new notion of distance between two graph states $∣ G ⟩$ and $∣ G^{'} ⟩$ on the same set of qubits. This distance is the minimum number of ancilla qubits in a gr…