Directed Borodin–Kostochka conjecture for maximum out-degree
Directed Borodin–Kostochka conjecture for maximum out-degree
Let be a digraph with maximum out-degree , biclique number , and dichromatic number . Write for the directed-cycle obstruction described above. Maximum-out-degree directed Borodin–Kostochka conjecture. If and , then
unless contains . This conjecture is presented as a stronger-parameter analogue of the preceding directed conjecture; the source proves the corresponding result for sufficiently large maximum out-degree but leaves the conjecture open.
Sources & referencesView supporting material
Primary source
Ararat Harutyunyan, Ken-ichi Kawarabayashi, Lucas Picasarri-Arrieta and Gil Puig i Surroca, “(Δ-1)-dicolouring of digraphs”, arXiv:2507.10266 (2025).
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.