Regular-graph self-improvement conjecture for the Bakry–Émery condition
Regular-graph self-improvement conjecture for the Bakry–Émery condition
Let be a -regular graph, meaning that every vertex has exactly neighbors. Assume that satisfies the discrete Bakry–Émery curvature-dimension condition .
Regular-graph self-improvement conjecture. Any -regular graph satisfying satisfies .
The result is proposed as a strengthening of the proved self-improvement theorem for edge-regular graphs, where the condition is obtained under the additional requirement that adjacent vertices have a fixed number of common neighbors. The conjecture would remove that edge-regularity assumption and would also imply the polynomial-growth conjecture through the paper's volume-doubling argument. It remains open in the source.
Progress summary
The conjecture remains open: a 2026 paper proves the analogous statement for edge-regular graphs, but no verified proof or counterexample is known for all regular graphs.
Blachar, Pajot, and Salez proposed in 2026 that every -regular graph satisfying also satisfies . Removing edge-regularity is the unresolved step, and the implication would yield polynomial growth.
Known results
- Edge-regular graphs satisfying satisfy a finite-dimensional condition with an explicit optimal (Blachar, Pajot, and Salez, 2026).
- In particular, an edge-regular graph satisfying satisfies and has volume doubling and polynomial growth.
- Finite-dimensional implies volume doubling, but this does not establish the conjectured self-improvement.
June 2026 formulation and status
The 2026 paper explicitly states the regular-graph assertion as Conjecture 2 and notes that its non-edge-regular seven-vertex example does not refute it. The scan found no verified proof, counterexample, AI-generated solution, or reported error concerning this conjecture.
Current status (as of August 2026): the edge-regular case and its polynomial-growth consequence are proved, while the implication from to for arbitrary -regular graphs remains open.
Sources
Sources & referencesView supporting material
Primary source
Guy Blachar, Hervé Pajot and Justin Salez, “Edge-regular graphs with non-negative curvature have polynomial growth”, arXiv:2606.11094 (2026).
Solutions 1
Sign in to submit a solution.
A 5-regular counterexample to the curvature-dimension self-improvement conjecture
Conjecture 2 of Blachar, Pajot and Salez, Edge-regular graphs with non-negative curvature have polynomial growth asserts that a -regular graph satisfying must satisfy . The following connected graph on twelve vertices is a counterexample with .
The verification has two parts. At every vertex, completing squares reduces nonnegative curvature to positivity of a small matrix. The exact determinants below establish that positivity, while one integer-valued function violates the stronger dimension-five inequality.
1. The graph and curvature convention
Let . Define a simple undirected graph by the following neighborhoods:
The table is symmetric and each row contains five distinct vertices other than its row label. Thus the graph is simple, undirected and 5-regular. Every vertex is at distance at most two from , so it is connected.
We use the unnormalized Laplacian and the curvature conventions of the conjecture:
For , the condition means that, for every function and every vertex ,
Here , so is the nonnegativity of every local quadratic form .
2. A local certificate for nonnegative curvature
Curvature-matrix reductions through Schur complements are standard; see Cushing, Kamtue, Liu and Peyerimhoff, Theorem 1.2. We include the needed identity directly.
Fix a vertex , and list its neighbors increasingly as . Let be the adjacency matrix induced on these five neighbors, and put
Write . Let be the set of vertices at distance exactly two from . For each , define
In particular, . With the identity matrix and the all-ones matrix, set
Subtracting a constant from does not change either or , so assume , and write . Expanding the definitions and completing the square separately in each gives
For clarity, the terms before completing the squares are
Thus positive semidefiniteness of implies nonnegative curvature at .
For , let be the determinant of the leading principal submatrix of , using the increasing neighbor order above. Substitution of the adjacency table into the definition of gives the following exact values. The equal rows for vertices and are combined.
Every entry is positive. By Sylvester's criterion, each is positive definite. The square decomposition therefore proves that, for every function and every vertex ,
Consequently, this graph satisfies .
3. Failure of the dimension-five bound
Define the integer-valued function by the following values:
At vertex , the neighborhood table gives
The remaining quantities needed in the definition of are
Moreover,
and hence
It follows that
But would require
whereas . The graph therefore satisfies but not , disproving Conjecture 2.