Every digraph with sufficiently large maximum geometric-mean degree either contains a biclique exceeding that bound minus 2b or has dichromatic number at most that bound minus b.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Coloring digraphs with $\Delta-b$ colors
Every digraph with sufficiently large maximum geometric-mean degree either contains a biclique exceeding that bound minus 2b or has dichromatic number at most that bound minus b.