Regular-graph self-improvement conjecture for the Bakry–Émery condition
Statement
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.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.