The strong four-vertex tournament conjecture
The strong four-vertex tournament conjecture
Let be the complete digraph on two vertices, let be the two-out-star, and let be the unique strong tournament on four vertices. For a family of forbidden induced digraphs, write for the corresponding class and for dichromatic number. Strong four-vertex tournament conjecture.
This is presented as the smallest open case of the broader question whether is heroic for every hero ; the authors state that a new method may be required.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Raphael Steiner, “On coloring digraphs with forbidden induced subgraphs”, arXiv:2103.04191 (2021).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.