加载中…
A long-standing conjecture in the emerging discrete Bakry-Émery theory asserts that bounded-degree graphs satisfying have polynomial growth. In the present paper, we prove this conjecture for all edge-regular graphs, and even obtain a volume doubling estimate with a constant that depends only on the degree. This is made possible thanks to the discovery of a surprising self-improvement phenomenon, which seems of independent interest: any edge-regular graph satisfying for some must in fact satisfy for some explicit, universal and optimal dimension parameter .

生成讲解博客的中文版本

生成AI智能校验的中文版本