S. Onishchenko

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2026

Maximum spread of vertex degrees in a simple graph

Sergey Onishchenko

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…

math.CO2025

Maximum Spread of Vertex Degrees in a Simple Graph

Sergey Dmitrievich Onishchenko

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…