加载中…
2017-03-11
Separating Tree-chromatic number from Path-chromatic Number
Fidel Barrera-CruzStefan FelsnerTamás MészárosPiotr MicekHeather SmithLibby TaylorWilliam T. Trotter
文献摘要
We apply Ramsey theoretic tools to show that there is a family of graphs which have tree-chromatic number at most~ while the path-chromatic number is unbounded. This resolves a problem posed by Seymour.
讨论
0讲解博客
生成讲解博客的中文版本
AI智能校验
生成AI智能校验的中文版本