Extremal-size conjecture for regular graphs with positive Lin–Lu–Yau curvature

From papers

Let Md\mathcal{M}_{d} denote the maximum number of vertices of a connected dd-regular graph with positive Lin–Lu–Yau curvature. For even degree, write d2Nd\in2\mathbb{N}. Extremal-size conjecture. For every d2Nd\in2\mathbb{N},

Md=5d.\mathcal{M}_{d}=\sqrt{5}^{d}.

The Cartesian power (C5)n(C_{5})^{\square n} supplies the lower bound Md5d\mathcal{M}_{d}\geq\sqrt{5}^{d} for even dd and has constant minimal positive Lin–Lu–Yau curvature. Determining the exact values of Md\mathcal{M}_{d} for d4d\geq4 remains open.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Moritz Hehl, “Ollivier-Ricci curvature of regular graphs”, arXiv:2407.08854 (2024).

Solutions 0

No solutions have been posted yet.