A. Skorkin

collaborators

2 papers

math.CO2021

Cycle saturation in random graphs

Yury Demidovich, Arkadiy Skorkin, Maksim Zhukovskii

For a fixed graph $F,$ the minimum number of edges in an edge-maximal $F$ -free subgraph of $G$ is called the $F$ -saturation number. The asymptotics of the $F$ -saturation number of…

math.CO2019

Maximum sparse induced subgraphs of the binomial random graph with given number of edges

Dmitry Kamaldinov, Arkadiy Skorkin, Maksim Zhukovskii

We prove that a.a.s. the maximum size of an induced subtree of the binomial random graph $G (n, p)$ is concentrated in 2 consecutive points. We also prove that, given a non-negative…