The maximum degree of planar graphs I. Series-parallel graphs
Abstract
We prove that the maximum degree n of a random series-parallel graph with n vertices satisfies n/ n c in probability, and E\, n c n for a computable constant c>0. The same result holds for outerplanar graphs.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.