M. Isaev

collaborators

3 papers

math.CO2025

Decomposing random regular graphs into stars

Michelle Delcourt, Catherine Greenhill, Mikhail Isaev +2

We study $k$ -star decompositions, that is, partitions of the edge set into disjoint stars with $k$ edges, in the uniformly random $d$ -regular graph model $G_{n, d}$ . Using…

math.CO2025

Kim--Vu's sandwich conjecture is true for $d ≫ lo g^{4} n$

Pu Gao, Mikhail Isaev, Brendan McKay

Kim and Vu made the following conjecture (\textit{Advances in Mathematics}, 2004): if $d ≫ lo g n$ , then the random $d$ -regular graph $G (n, d)$ can be ``sandwiched'' between $G(n,p…

math.PR2025

Extremal independence in discrete random systems

Mikhail Isaev, Igor Rodionov, Rui-Ray Zhang +1

Let $X (n) \in R^{d}$ be a sequence of random vectors, where $n \in N$ and $d = d (n)$ . Under certain weakly dependence conditions, we prove that the distribut…

Decomposing random regular graphs into stars

Kim--Vu's sandwich conjecture is true for d≫log4n

Extremal independence in discrete random systems

Kim--Vu's sandwich conjecture is true for $d ≫ lo g^{4} n$