By Dr Mikhail Isaev

Preprints

Isaev M; Kang M, 2021, On the chromatic number of graphons, https://arxiv.org/abs/2109.07773v3

Isaev M; Kang M, 2021, On the chromatic number in the stochastic block model, https://arxiv.org/abs/2109.00737v2

Isaev M; Novikov RG, 2021, Reconstruction from the Fourier transform on the ball via prolate spheroidal wave functions, https://arxiv.org/abs/2107.07882v1

Isaev M; Rodionov I; Zhang R-R; Zhukovskii M, 2021, Extremal independence in discrete random systems, https://arxiv.org/abs/2105.04917v3

Gao P; Isaev M; McKay B, 2020, Kim--Vu's sandwich conjecture is true for $d \gg \log^4 n$, https://arxiv.org/abs/2011.09449v5

Greenhill C; Isaev M; McKay BD, 2020, Subgraph counts for dense random graphs with specified degrees, http://dx.doi.org/10.48550/arxiv.1801.09813

Isaev M; Novikov RG, 2020, Stability estimates for reconstruction from the Fourier transform on the ball, https://arxiv.org/abs/2007.12013v1

Isaev M; Novikov RG, 2020, Hölder-logarithmic stability in Fourier synthesis, https://doi.org/10.1088/1361-6420/abb5df

Isaev M; Southwell A; Zhukovskii M, 2019, Distribution of tree parameters by martingale approach, https://doi.org/10.1017/S0963548321000523

Altman D; Greenhill C; Isaev M; Ramadurai R, 2019, A threshold result for loose Hamiltonicity in random regular uniform hypergraphs, http://dx.doi.org/10.48550/arxiv.1611.09423

Isaev M; Iyer T; McKay BD, 2019, Asymptotic enumeration of orientations of a graph as a function of the out-degree sequence, https://arxiv.org/abs/1908.01309v2

Gao P; Isaev M; McKay B, 2019, Sandwiching random regular graphs between binomial random graphs, https://arxiv.org/abs/1906.02886v5

Greenhill C; Isaev M; Kwan M; McKay BD, 2017, The average number of spanning trees in sparse graphs with given degrees, http://dx.doi.org/10.48550/arxiv.1606.01586

Isaev M; McKay BD, 2016, Complex martingales and asymptotic enumeration, https://doi.org/10.1002/rsa.20754

Back to profile page