Separating Tree-chromatic number from Path-chromatic Number
Combinatorics
2019-02-01 v3
Abstract
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.
Keywords
Cite
@article{arxiv.1703.03973,
title = {Separating Tree-chromatic number from Path-chromatic Number},
author = {Fidel Barrera-Cruz and Stefan Felsner and Tamás Mészáros and Piotr Micek and Heather Smith and Libby Taylor and William T. Trotter},
journal= {arXiv preprint arXiv:1703.03973},
year = {2019}
}
Comments
reviewers comments included