A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf
.
Every Orientation of a $4$-Chromatic Graph has a Non-Bipartite Acyclic Subgraph
2022
Electronic Journal of Combinatorics
Let $f(n)$ denote the smallest integer such that every directed graph with chromatic number larger than $f(n)$ contains an acyclic subgraph with chromatic number larger than $n$. The problem of bounding this function was introduced by Addario-Berry et al., who noted that $f(n) \leqslant n^2$. The only improvement over this bound was obtained by Nassar and Yuster, who proved that $f(2)=3$ using a deep theorem of Thomassen. Yuster asked if this result can be proved using elementary methods. In this short note we provide such a proof.
doi:10.37236/10727
fatcat:5ztkwahiancwzodxsbno3vuwhe