Separating tree-chromatic number from path-chromatic number

Fidel Barrera-Cruz,Stefan Felsner,Tamás Mészáros,Piotr Micek,Heather Smith,Libby Taylor,William T. Trotter

Journal of Combinatorial Theory, Series B（2019）

引用 4|浏览60

暂无评分

摘要

We apply Ramsey theoretic tools to show that there is a family of graphs which have tree-chromatic number at most 2 while the path-chromatic number is unbounded. This resolves a problem posed by Seymour.

查看译文

关键词

Binary tree,Ramsey theory,Tree-decomposition

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要