Table of Contents
Fetching ...

Graphs with positive Lin-Lu-Yau curvature without quadrilaterals

Huiqiu Lin, Zhe You

TL;DR

The paper classifies all simple connected $C_4$-free graphs with minimum degree at least $2$ that have positive Lin-Lu-Yau curvature, showing the only possibilities are $C_3$, $C_5$, the graphs $T$ and $H$ (line graph of the Petersen graph), and the friendship graphs $F_2$ and $F_3$. Using the limit-free Laplacian formulation of $\kappa_{\mathrm{LLY}}$, it derives structural constraints (notably $\Delta(G)\le6$) and performs case analysis to obtain this finite list. It verifies positivity for the candidate graphs (some by explicit estimates, others via a curvature calculator). The work further discusses extensions to graphs with pendant edges and highlights limitations under induced $C_4$-free relaxations, proposing future directions for classifying graphs with non-negative curvature.

Abstract

The definition of Ricci curvature on graphs was given in Lin-Lu-Yau, Tohoku Math., 2011, which is a variation of Ollivier, J. Funct. Math., 2009. Recently, a powerful limit-free formulation of Lin-Lu-Yau curvature using the graph Laplacian has been given in Münch-Wojciechowski, Adv. Math., 2019. Let $F_k$ be the friendship graph obtained from $k$ triangles by sharing a common vertex and $T$ be the graph obtained from a triangle and $K_{1,3}$ by adding a matching between every leaf of $K_{1,3}$ and a vertex of the triangle. In this paper, we classify all the simple connected $C_4$-free graphs with positive Lin-Lu-Yau curvature for minimum degree at least 2: the cycles $C_3,C_5$, the friendship graphs $F_2,F_3$, the line graph of Peterson graph, and $T$.

Graphs with positive Lin-Lu-Yau curvature without quadrilaterals

TL;DR

The paper classifies all simple connected -free graphs with minimum degree at least that have positive Lin-Lu-Yau curvature, showing the only possibilities are , , the graphs and (line graph of the Petersen graph), and the friendship graphs and . Using the limit-free Laplacian formulation of , it derives structural constraints (notably ) and performs case analysis to obtain this finite list. It verifies positivity for the candidate graphs (some by explicit estimates, others via a curvature calculator). The work further discusses extensions to graphs with pendant edges and highlights limitations under induced -free relaxations, proposing future directions for classifying graphs with non-negative curvature.

Abstract

The definition of Ricci curvature on graphs was given in Lin-Lu-Yau, Tohoku Math., 2011, which is a variation of Ollivier, J. Funct. Math., 2009. Recently, a powerful limit-free formulation of Lin-Lu-Yau curvature using the graph Laplacian has been given in Münch-Wojciechowski, Adv. Math., 2019. Let be the friendship graph obtained from triangles by sharing a common vertex and be the graph obtained from a triangle and by adding a matching between every leaf of and a vertex of the triangle. In this paper, we classify all the simple connected -free graphs with positive Lin-Lu-Yau curvature for minimum degree at least 2: the cycles , the friendship graphs , the line graph of Peterson graph, and .

Paper Structure

This paper contains 5 sections, 14 theorems, 30 equations, 6 figures.

Key Result

Theorem 1.1

Let $G$ be a simple connected graph which is $2$-cell embedded into a surface $S$ so that every vertex and face has degree at least $3$. If $G$ has positive combinatorial curvature (everywhere), then $G$ is finite and $S$ is homeomorphic to either a$2$-sphere or the projective plane. Furthermore, if

Figures (6)

  • Figure 1: Graph $T$ with positive LLY curvature.
  • Figure 2: The line graph of Peterson graph denoted by $H$
  • Figure 3: Graph $F_3'$ with positive LLY curvature and one pendant edge.
  • Figure 4: Graph $G_1$ containing some edges with 0 LLY curvature.
  • Figure 5: Graph $F$ with three triangles.
  • ...and 1 more figures

Theorems & Definitions (22)

  • Theorem 1.1: Devos
  • Theorem 1.2: outerplanar
  • Theorem 1.3: LLW24
  • Theorem 1.4
  • Theorem 1.5
  • Lemma 2.1: LLY
  • Theorem 2.1: Munch
  • Lemma 3.1: girth5
  • Lemma 3.2: girth5
  • Lemma 3.3
  • ...and 12 more