S. Onishchenko

collaborators

3 papers

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…

cs.FL2026

Nondeterministic state complexity of square root

Sergey Onishchenko

We investigate the nondeterministic state complexity of the square-root operation $L = {w ∣ w w \in L}$ on regular languages represented by nondeterministic finite auto…

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…