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
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2representative citing papers
Proves 1/2-rate quantitative ergodicity for Hamilton-Jacobi equations in dynamic random media via new almost-Lipschitz regularity for the metric problem.
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.
-
Quantification of ergodicity for Hamilton--Jacobi equations in a dynamic random environment
Proves 1/2-rate quantitative ergodicity for Hamilton-Jacobi equations in dynamic random media via new almost-Lipschitz regularity for the metric problem.