arXiv:2611.23460v1 Announce Type: new Abstract: We prove that every 5-chromatic digraph containing no copy of the regular tournament on five vertices contains both antidirected paths on five vertices. This answers a question posed by El Sahili in 2004. The proof uses an edge bound for 5-critical graphs to constrain the out-degrees in a counterexample and obtain a contradiction by constructing a proper 4-colouring.
Continue to arXiv Mathematics →You are being forwarded in 6s — stay on this page