On the size of outerplanar graphs with positive Lin-Lu-Yau Ricci curvature
Xiaonan Liu, Linyuan Lu, Zhiyu Wang

TL;DR
This paper proves that outerplanar graphs with minimum degree at least 2 and positive Lin-Lu-Yau Ricci curvature on all vertex pairs have at most 10 vertices, establishing a sharp upper bound.
Contribution
It extends previous results by showing a sharp size bound for such graphs with positive Ricci curvature.
Findings
Outerplanar graphs with positive Ricci curvature have at most 10 vertices.
The bound of 10 vertices is sharp.
The result generalizes earlier work by Brooks et al.
Abstract
In this paper, extending a result of Brooks et.al. [arXiv:2403.04110], we show that if an outerplanar graph with minimum degree at least has positive Lin-Lu-Yau curvature on every vertex pair, then has at most vertices, and this upper bound is sharp.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGeometric Analysis and Curvature Flows · Advanced Differential Geometry Research · Ophthalmology and Eye Disorders
