
arXiv: 1703.03973
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.
reviewers comments included
binary tree, Coloring of graphs and hypergraphs, tree-decomposition, Ramsey theory, FOS: Mathematics, Generalized Ramsey theory, Mathematics - Combinatorics, Combinatorics (math.CO)
binary tree, Coloring of graphs and hypergraphs, tree-decomposition, Ramsey theory, FOS: Mathematics, Generalized Ramsey theory, Mathematics - Combinatorics, Combinatorics (math.CO)
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 2 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
