Chromatic number is not tournament-local

arXiv2305.15585MaRDI QIDQ6437889FDOQ6437889

Authors: António Girão, Kevin Hendrey, Freddie Illingworth, Florian Lehner, Lukas Michel, Raphael Steiner 

Publication date: 24 May 2023

Abstract: Scott and Seymour conjectured the existence of a function $fcolonmathbbNomathbbN$ such that, for every graph $G$ and tournament $T$ on the same vertex set, $chi(G)geqslantf(k)$ implies that $chi(G[N_T^{+}(v)])geqslantk$ for some vertex $v$. In this note we disprove this conjecture even if $v$ is replaced by a vertex set of size $mathcalO(loglvertV(G)vert)$. As a consequence, we answer in the negative a question of Harutyunyan, Le, Thomass'{e}, and Wu concerning the corresponding statement where the graph $G$ 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.

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Coloring of graphs and hypergraphs (05C15)

This page was built for publication: Chromatic number is not tournament-local

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6437889)