Skip to content
DraconiticResearch
Search Sources API
182,544 studies31 sourcesUpdated 4 min ago
PreprintarXiv licencearXiv

A rigidity theorem for edge-connectivity under non-negative Bakry--Émery curvature

Abstract

The edge-connectivity κ(G) of a graph G is the minimum number of edges whose removal disconnects G, and it is bounded above by the minimum degree δ(G). We classify all connected locally finite simple graphs with nonnegative Bakry--Émery curvature satisfying κ(G)<δ(G). All such graphs are infinite. Consequently, every finite connected simple graph with nonnegative Bakry--Émery curvature satisfies κ(G)=δ(G), confirming a conjecture of Chen, Koolen, and Liu.

Related

  1. Entropy estimates and volume rigidity for graphs with positive Bakry-Émery curvature
    Yanlong Ding, Shiping Liu, Chiyu Zhou
    arXivPreprintarXiv licenceFull textAnalysis & PDEsCombinatorics & discrete mathematicsarXiv
  2. Obata-type equations under the Bakry-Émery Ricci curvature conditions
    Mijia Lai, Yiwei Liu
    arXivPreprintarXiv licenceFull textGeometry & topologyarXiv
  3. Green-Function Monotonicity under Positive Bakry-Émery Curvature
    Yu-Zhao Wang, Zeng-Ting Wu
    arXivPreprintCC BY 4.0Full textGeometry & topologyarXiv
  4. Volume Doubling and Geometric Inequalities on Graphs with Bakry-Émery Curvature
    Yanlong Ding, Shiping Liu, Chiyu Zhou
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsGeometry & topologyarXiv
  5. Rigidity of conformal metrics with constant sixth-order Q-curvature
    Daowen Lin, Wangzhe Wu
    arXivPreprintarXiv licenceFull textAnalysis & PDEsGeometry & topologyarXiv
BibTeX
@misc{chen2026rigidity,
  title = {{A rigidity theorem for edge-connectivity under non-negative Bakry--Émery curvature}},
  author = {Kaizhe Chen and Shiping Liu and Haotian Yang},
  howpublished = {arXiv},
  year = {2026},
  month = nov,
  doi = {10.48550/arxiv.2611.01535},
  eprint = {2611.01535},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2611.01535},
}
RIS
TY  - UNPB
TI  - A rigidity theorem for edge-connectivity under non-negative Bakry--Émery curvature
AU  - Kaizhe Chen
AU  - Shiping Liu
AU  - Haotian Yang
PY  - 2026
DA  - 2026/11/01
PB  - arXiv
DO  - 10.48550/arxiv.2611.01535
UR  - https://arxiv.org/abs/2611.01535
AB  - The edge-connectivity κ(G) of a graph G is the minimum number of edges whose removal disconnects G, and it is bounded above by the minimum degree δ(G). We classify all connected locally finite simple graphs with nonnegative Bakry--Émery curvature satisfying κ(G)<δ(G). All such graphs are infinite. Consequently, every finite connected simple graph with nonnegative Bakry--Émery curvature satisfies κ(G)=δ(G), confirming a conjecture of Chen, Koolen, and Liu.
ER  -