← All problems

Chen–Koolen–Liu edge-connectivity conjecture

For every finite connected simple graph GG with non-negative Lin–Lu–Yau curvature, κ(G)=δ(G)\kappa(G)=\delta(G), where κ(G)\kappa(G) is the edge-connectivity and δ(G)\delta(G) is the minimum degree.

References

Source: arXiv

Progress summary

Refreshed
Open · solution reported

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 κ(G)=δ(G)\kappa(G)=\delta(G). A related Liu–Xia preprint proves the bound k′(G)≥δ(G)−1k'(G)\geq\delta(G)-1 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.

Sources

Solutions 0

No solutions have been posted yet.