Pith. sign in

REVIEW 1 cited by

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

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

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

Xiaonan Liu , Linyuan Lu , Zhiyu Wang This is my paper · ORCID
classification math.CO
keywords curvaturelin-lu-yauouterplanarpositivearxivboundbrooksdegree
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. On Lichnerowicz sharp distance-regular graphs

    math.CO 2026-02 accept novelty 6.0 of 10

    Every Lichnerowicz sharp distance-regular graph is a cocktail party, Hamming, Johnson, demi-cube, Schläfli, or Gosset graph; the extra spectral condition used in earlier work is redundant.

Pith tools