The maximum number of induced P_{k+1} in n-vertex outerplanar graphs is bounded using Fibonacci numbers, yielding a growth rate limit of the golden ratio (1+sqrt(5))/2.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The number of induced paths in outerplanar graphs
The maximum number of induced P_{k+1} in n-vertex outerplanar graphs is bounded using Fibonacci numbers, yielding a growth rate limit of the golden ratio (1+sqrt(5))/2.