Zhukovskii Maksim Evgen'evich

Publications in Math-Net.Ru

1. Saturation in Kneser graphs
   
   Mat. Zametki, 116:2 (2024),  185–194
2. Weakly saturated subgraphs of random graphs
   
   Dokl. RAN. Math. Inf. Proc. Upr., 509 (2023),  46–49
3. Erratum to: Several Articles in Doklady Mathematics
   
   Dokl. RAN. Math. Inf. Proc. Upr., 506 (2022),  402–403
4. Behavior of binomial distribution near its median
   
   Dokl. RAN. Math. Inf. Proc. Upr., 503 (2022),  45–47
5. On coverings of tori with cubes
   
   Dokl. RAN. Math. Inf. Proc. Upr., 503 (2022),  30–32
6. On the 4-spectrum of first-order properties of random graphs
   
   Dokl. RAN. Math. Inf. Proc. Upr., 500 (2021),  31–34
7. Chromatic Numbers of Distance Graphs without Short Odd Cycles in Rational Spaces
   
   Mat. Zametki, 109:5 (2021),  723–733
8. First-Order Complexity of Subgraph Isomorphism via Kneser Graphs
   
   Mat. Zametki, 109:1 (2021),  36–46
9. Logical complexity of induced subgraph isomorphism for certain families of graphs
   
   Mat. Sb., 212:4 (2021),  76–90
10. Minimum clique-free subgraphs of Kneser graphs
    
    Dokl. RAN. Math. Inf. Proc. Upr., 495 (2020),  31–33
11. On the convergence of probabilities of first-order sentences for recursive random graph models
    
    Dokl. RAN. Math. Inf. Proc. Upr., 494 (2020),  35–37
12. The Median of the Number of Simple Paths on Three Vertices in the Random Graph
    
    Mat. Zametki, 107:1 (2020),  49–58
13. Extreme value theory for triangular arrays of dependent random variables
    
    Uspekhi Mat. Nauk, 75:5(455) (2020),  193–194
14. First-order zero-one law for the uniform model of the random graph
    
    Mat. Sb., 211:7 (2020),  60–71
15. On a connection of two graph-theoretic problems with conjectures of Ramanujan and Samuels
    
    Uspekhi Mat. Nauk, 73:4(442) (2018),  173–174
16. About the power law of the PageRank vector distribution. Part 2. Backley–Osthus model, power law verification for this model and setup of real search engines
    
    Sib. Zh. Vychisl. Mat., 21:1 (2018),  23–45
17. Small subgraphs and their extensions in a random distance graph
    
    Mat. Sb., 209:2 (2018),  22–46
18. First-order properties of bounded quantifier depth of very sparse random graphs
    
    Izv. RAN. Ser. Mat., 81:6 (2017),  100–113
19. Quantifier alternation in first-order formulas with infinite spectra
    
    Probl. Peredachi Inf., 53:4 (2017),  95–108
20. Universal Zero-One $k$-Law
    
    Mat. Zametki, 99:4 (2016),  511–525
21. When Does the Zero-One $k$-Law Fail?
    
    Mat. Zametki, 99:3 (2016),  342–349
22. On the Zero-One 4-Law for the Erdős–Rényi Random Graphs
    
    Mat. Zametki, 97:2 (2015),  203–216
23. The spectra of first-order formulae having low quantifier rank
    
    Uspekhi Mat. Nauk, 70:6(426) (2015),  209–210
24. Random graphs: models and asymptotic characteristics
    
    Uspekhi Mat. Nauk, 70:1(421) (2015),  35–88
25. The largest critical point in the zero-one $k$-law
    
    Mat. Sb., 206:4 (2015),  13–34
26. Law of large numbers for the number of active particles in the epidemic model
    
    Teor. Veroyatnost. i Primenen., 58:2 (2013),  235–254
27. Estimation of the number of maximal extensions in a random graph
    
    Diskr. Mat., 24:1 (2012),  79–107
28. On the Probability of the Occurrence of a Copy of a Fixed Graph in a Random Distance Graph
    
    Mat. Zametki, 92:6 (2012),  844–855
29. A weak zero-one law for sequences of random distance graphs
    
    Mat. Sb., 203:7 (2012),  95–128
30. On a sequence of random distance graphs subject to the zero-one law
    
    Probl. Peredachi Inf., 47:3 (2011),  39–58
31. The weak zero-one law for the random distance graphs
    
    Teor. Veroyatnost. i Primenen., 55:2 (2010),  344–350