On the size of outerplanar graphs with positive Lin-Lu-Yau Ricci curvature
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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.