Chen–Koolen–Liu edge-connectivity conjecture
For every finite connected simple graph with non-negative Lin–Lu–Yau curvature, , where is the edge-connectivity and is the minimum degree.
References
- A rigidity theorem for edge-connectivity under non-negative Bakry–Émery curvature — arXiv — Kaizhe Chen, Shiping Liu, Haotian Yang
Source: arXiv
Progress summary
A November 2026 preprint claims to settle the finite case, but the result has not been independently checked.
The conjecture asserts that every finite connected graph with non-negative Lin–Lu–Yau curvature has edge-connectivity equal to its minimum degree, answering an open question posed by Chen, Liu, and You.
Known results
- Positive Lin–Lu–Yau curvature implies edge-connectivity equals minimum degree for connected graphs (Chen, Liu, and You).
November 2026 claimed classification
A preprint by Kaizhe Chen, Shiping Liu, and Haotian Yang claims to classify all locally finite equality-counterexamples and deduces the finite conclusion . A related Liu–Xia preprint proves the bound and claims that equality occurs only for infinite, two-ended graphs. These are unrefereed claims without independent mathematical assessment.
Current status (as of November 2026): the finite case is claimed solved, but the classification and its consequence remain unverified.
Solutions 0
No solutions have been posted yet.