Vertex degrees close to the average degree
Abstract
Let G be a finite, simple, and undirected graph of order n and average degree d. Up to terms of smaller order, we characterize the minimal intervals I containing d that are guaranteed to contain some vertex degree. In particular, for d+∈ (dn,n-1], we show the existence of a vertex in G of degree between d+-((d+-d)nn-d++d+2-dn) and d+.
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.