科研速览 · Science Skim继续刷下去 · Keep skimming →
◇ arXiv2026-08-21· math.CO

The Asayama-Matsumoto conjecture and a refined discrepancy bound

Alessio Basti, Tommaso Cremaschi

原始摘要(英文原文)· Original abstract
Every $n$-vertex plane triangulation admits a polychromatic red--blue vertex coloring with discrepancy at most $n-2\ceil{n/3}\le\floor{n/3}$, resolving a conjecture of Asayama and Matsumoto. The proof follows by combining Loyola et al. 2026 and Kawarabayashi et al. 2026. For $n\ge6$ and $n\not\equiv5\pmod6$, we prove the sharper bound $n-2\ceil{(n+2)/3}$. An exhaustive census of all $9{,}150$ non-isomorphic sphere triangulations with $4\le n\le12$ verifies the bounds and also confirms the sharper estimate at $n=11$, the first order in the remaining open residue class.
读原文 · Read the paper ↗

AI 追问PRO

登录后使用 AI 追问

讨论区

登录后参与讨论

相关论文 · Related

The Asayama-Matsumoto conjecture and a refined discrepancy bound — 科研速览 Science Skim