Maximum spread of vertex degrees in a simple graph

[2608.27537] Maximum spread of vertex degrees in a simple graph Skip to main content Search Submit Donate Log in Mathematics > Combinatorics arXiv:2608.27537 (math) [Submitted on 27 Aug 2026] Title: Maximum spread of vertex degrees in a simple graph Authors: Sergey Onishchenko View PDF HTML (experimental) Abstract: We consider the following problem: let $n>k$ --- positive integers, $G$ --- a graph on $n$ vertices (undirected, without loops or multiple edges). Let $h_k(G)$ denote the number of unordered pairs of vertices of the graph $G$ whose degrees differ by less than $k$. We seek to determine the smallest possible value $f(n,k)$ of $h_k(G)$. The interest in this question is motivated by the fact that the bipartite analogue of the problem allowed S. Cichomski and F. Petrov \cite{CP} to prove the Burdzy--Pitman conjecture on the spread of independent identically distributed random variables. Subjects: Combinatorics (math.CO) Cite as: arXiv:2608.27537 [math.CO] (or arXiv:2608.27537v1 [math.CO] for this version) https://doi.org/10.48550/arXiv.2608.27537 Focus to learn more arXiv-issued DOI via DataCite Submission history From: Sergey Onishchenko [ view email ] [v1] Thu, 27 Aug 2026 15:59:58 UTC (9 KB) Full-text links: Access Paper: View PDF HTML (experimental) TeX Source view license Current browse context: math.CO < prev | next > new | recent | 2026-08 Change to browse by: math References & Citations SciX Google Scholar Semantic Scholar export BibTeX citation Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer ( What is the Explorer? ) Connected Papers Toggle Connected Papers ( What is Connected Papers? ) Litmaps Toggle Litmaps ( What is Litmaps? ) scite.ai Toggle scite Smart Citations ( What are Smart Citations? ) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv ( What is alphaXiv? ) Links to Code Toggle CatalyzeX Code Finder for Papers ( What is CatalyzeX? ) DagsHub Toggle DagsHub ( What is DagsHub? ) GotitPub Toggle Gotit.pub ( What is GotitPub? ) Huggingface Toggle Hugging Face ( What is Huggingface? ) ScienceCast Toggle ScienceCast ( What is ScienceCast? ) Demos Demos Replicate Toggle Replicate ( What is Replicate? ) Spaces Toggle Hugging Face Spaces ( What is Spaces? ) Spaces Toggle TXYZ.AI ( What is TXYZ.AI? ) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower ( What are Influence Flowers? ) Core recommender toggle CORE Recommender ( What is CORE? ) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs . Which authors of this paper are endorsers? | Disable MathJax ( What is MathJax? ) We gratefully acknowledge support from our major funders , member institutions , and all contributors. About · Help · Contact · Subscribe · Copyright · Privacy · Accessibility · Operational Status (opens in new tab)

Related documents

• Maximum spread of vertex degrees in a simple graph#779472
• The Erdős Matching Conjecture for 4-uniform hypergraphs#1070833
• Large induced subgraphs with $k$ vertices of maximum degree#822116
• On $k$-limited domination: complexity and Cartesian products#1156397
• Max Independent Set Remains NP-hard when Excluding a Planar Induced Minor#998825