M. Koshelev

9 citations · 10 across the 3 of their papers we have counts for

collaborators

3 papers

math.CO2026★ 1 cited

Modularity in planted partition model

M. Koshelev

We obtain tight bounds on the modularity of PPM graphs in the case of equally sized parts. Moreover, we provide a general method that can help in obtaining bounds for various other…

math.CO2026★ 9 cited

Spectrum of Johnson graphs

M. Koshelev

In this paper we prove new bounds on the second eigenvalue of Johnson graphs. We then apply these bounds to obtain new results on the modularity of Johnson graphs and their random…

math.CO2025

Spectral gap of $G (n, α n, α^{2} n)$ graphs and the giant component theorem

M. Koshelev, A. Raigorodskii

The spectrum of a graph $G$ is the set of the eigenvalues of its adjacency matrix. It turns out that one can say a lot about a graph with the only knowledge being the spectrum of t…

Modularity in planted partition model

Spectrum of Johnson graphs

Spectral gap of G(n,αn,α2n) graphs and the giant component theorem

Spectral gap of $G (n, α n, α^{2} n)$ graphs and the giant component theorem