English

Vertex degrees close to the average degree

Combinatorics 2023-01-20 v1 Discrete Mathematics

Abstract

Let GG be a finite, simple, and undirected graph of order nn and average degree dd. Up to terms of smaller order, we characterize the minimal intervals II containing dd that are guaranteed to contain some vertex degree. In particular, for d+(dn,n1]d_+\in \left(\sqrt{dn},n-1\right], we show the existence of a vertex in GG of degree between d+((d+d)nnd++d+2dn)d_+-\left(\frac{(d_+-d)n}{n-d_++\sqrt{d_+^2-dn}}\right) and d+d_+.

Keywords

Cite

@article{arxiv.2301.07953,
  title  = {Vertex degrees close to the average degree},
  author = {Johannes Pardey and Dieter Rautenbach},
  journal= {arXiv preprint arXiv:2301.07953},
  year   = {2023}
}
R2 v1 2026-06-28T08:15:10.609Z