Siblings of countable cographs
arxiv(2020)
摘要
We show that every countable cograph has either one or infinitely many siblings. This answers, very partially, a conjecture of Thomass\'e. The main tools are the notion of well quasi ordering and the correspondence between cographs and some labelled ordered trees.
更多查看译文
关键词
countable cographs
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要