Siblings of countable cographs
arXiv:2004.12457
Abstract
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 ordering and the correspondence between cographs and some labelled ordered trees.
Dedicated to the memory of Ivo G. Rosenberg, Three figures, 27 pages