Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2509.21429

Maximum Spread of Vertex Degrees in a Simple Graph

Sergey Dmitrievich Onishchenko
View original source ↗Read source document ↗Export metadata ↓

Abstract

We consider the following problem: let $n>k$ be natural numbers, and let $G$ be a graph on $n$ vertices (undirected, without loops or multiple edges). Denote by $h_k(G)$ the number of unordered pairs of vertices in the graph $G$ whose degrees differ by less than $k$. We aim to determine the smallest possible value $f(n,k)$ of the quantity $h_k(G)$. Interest in this question is motivated by the fact that the bipartite analogue of the problem enabled S. Cichomski and F. Petrov to prove the Burdzy -- Pitman conjecture on the spread of independent coherent random variables. The problem has been solved under a number of restrictions on $n$ and $k$. A conjecture about the answer in the general case is also presented.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sergey Dmitrievich Onishchenko. 2026-01-14. Maximum Spread of Vertex Degrees in a Simple Graph. https://arxiv.org/abs/2509.21429

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗