Colin Geniet

activity

20202026

most citedSparse graphs with bounded induced cycle packing number have logarithmic treewidth

8 citations · 11 across the 16 of their papers we have counts for

collaborators

Showing 2023Show all

3 papers · 1 filter

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…

cs.DS2023

Maximum Independent Set when excluding an induced minor: $K_{1} + t K_{2}$ and $t C_{3} ⊎ C_{4}$

Édouard Bonnet, Julien Duron, Colin Geniet +2

Dallard, Milanič, and Štorgel [arXiv '22] ask if for every class excluding a fixed planar graph $H$ as an induced minor, Maximum Independent Set can be solved in polynomial time, a…

Factoring Pattern-Free Permutations into Separable ones

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

Maximum Independent Set when excluding an induced minor: K1​+tK2​ and tC3​⊎C4​

Maximum Independent Set when excluding an induced minor: $K_{1} + t K_{2}$ and $t C_{3} ⊎ C_{4}$