Edge-Connectivity versus Lin--Lu--Yau Curvature

arXiv:2610.10559 · math.CO, math.DG · Submitted 2026-09-30 · Read on arXiv

math.CO, math.DG

Submitted: 2026-09-30

Updated: 2026-11-02

License: http://creativecommons.org/publicdomain/zero/1.0/

The gist: We systematically explore the relationship between edge-connectivity and Lin--Lu--Yau curvature for graphs.

Abstract

We systematically explore the relationship between edge-connectivity and Lin--Lu--Yau curvature for graphs. The intuition is that a connected graph with large Lin--Lu--Yau curvature should also have large edge-connectivity, and vice versa under suitable conditions. We prove that the edge-connectivity of a connected graph is bounded lower by the product of its minimum degree, its Lin--Lu--Yau curvature and the constant 3 over 2. We also provide two lower bounds on the edge-connectivity of a graph that guarantee positive Lin--Lu--Yau curvature, and discuss the sharpness of these bounds.

Sources

Related papers