Kawarabayashi–Picasarri-Arrieta Reed-type conjecture for digraphs
Kawarabayashi–Picasarri-Arrieta Reed-type conjecture for digraphs
Let be a digraph. Define its maximum geometric-mean degree by
let be its biclique number, and let be its dichromatic number. Kawarabayashi–Picasarri-Arrieta conjecture.
This is a directed analogue of Reed's conjecture. The source records an intermediate result with an error parameter, but does not state that the conjecture itself is resolved.
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.