Separating Tree-chromatic number from Path-chromatic Number
Abstract
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.