The reviewed record of science sign in
Pith

arxiv: 2409.13666 · v1 · pith:ABDVSHQE · submitted 2024-09-20 · math.CO

On the size of outerplanar graphs with positive Lin-Lu-Yau Ricci curvature

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:ABDVSHQErecord.jsonopen to challenge →

classification math.CO
keywords curvaturelin-lu-yauouterplanarpositivearxivboundbrooksdegree
0
0 comments X
read the original abstract

In this paper, extending a result of Brooks et.al. [arXiv:2403.04110], we show that if an outerplanar graph $G$ with minimum degree at least $2$ has positive Lin-Lu-Yau curvature on every vertex pair, then $G$ has at most $10$ vertices, and this upper bound is sharp.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.