Chromatic number is not tournament-local
arXiv:2305.15585
Abstract
Scott and Seymour conjectured the existence of a function such that, for every graph and tournament on the same vertex set, implies that for some vertex . In this note we disprove this conjecture even if is replaced by a vertex set of size . As a consequence, we answer in the negative a question of Harutyunyan, Le, Thomassé, and Wu concerning the corresponding statement where the graph is replaced by another tournament, and disprove a related conjecture of Nguyen, Scott, and Seymour. We also show that the setting where chromatic number is replaced by degeneracy exhibits a quite different behaviour.
7 pages; funding information added