Every n≥8 vertex planar graph with no 8-cycle has at most 69/25 (n−2) edges, improving the previous best coefficient ≈2.99 to 2.76.
Title resolution pending
1 Pith paper cite this work, alongside 11 external citations. Polarity classification is still indexing.
1
Pith paper citing it
11
external citations · OpenAlex
fields
math.CO 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
An improved upper bound for the planar Tur\'an number of $C_8$
Every n≥8 vertex planar graph with no 8-cycle has at most 69/25 (n−2) edges, improving the previous best coefficient ≈2.99 to 2.76.