Colin Geniet

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

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

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2024

Half-integral Erdős-Pósa property for non-null $S$ - $T$ paths

Vera Chekan, Colin Geniet, Meike Hatzel +4

For a group $Γ$ , a $Γ$ -labelled graph is an undirected graph $G$ where every orientation of an edge is assigned an element of $Γ$ so that opposite orientations of the same edge are…

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…

Half-integral Erdős-Pósa property for non-null S-T paths

Factoring Pattern-Free Permutations into Separable ones

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

Half-integral Erdős-Pósa property for non-null $S$ - $T$ paths