Aboulker et al.'s directed cycle subdivision conjecture
Aboulker et al.'s directed cycle subdivision conjecture
Let be the undirected cycle of length , and let be an orientation of . For a digraph , let be the smallest integer such that every digraph with dichromatic number contains a subdivision of . Aboulker et al.'s conjecture. If is an orientation of , then
This conjecture concerns the threshold at which large dichromatic number forces subdivisions of directed cycles. The paper's abstract states that this conjecture is settled by proving the asserted equality.
Sources & referencesView supporting material
Primary source
Lior Gishboliner, Raphael Steiner and Tibor Szabó, “Dichromatic number and forced subdivisions”, arXiv:2008.09888 (2020).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.