4 citations · 5 across the 3 of their papers we have counts for
3 papers
math.CO2020★ 1 cited
Siblings of countable cographs
Gena Hahn, Maurice Pouzet, Robert Woodrow
We show that every countable cograph has either one or infinitely many siblings. This answers, very partially, a conjecture of Thomassé. The main tools are the notion of well quasi…
math.CO2017
A lower bound on the size of an absorbing set in an arc-coloured tournament
Laurent Beaudou, Luc Devroye, Gena Hahn
Bousquet, Lochet and Thomassé recently gave an elegant proof that for any integer , there is a least integer such that any tournament whose arcs are coloured with col…
math.CO2016★ 4 cited
Cops and Robbers ordinals of cop-win trees
Anthony Bonato, Przemysław Gordinowicz, Gena Hahn
A relational characterization of cop-win graphs was provided by Nowakowski and Winkler in their seminal paper on the game of Cops and Robbers. As a by-product of that characterizat…