top of page

Research interests

  • Probabilistic and extremal combinatorics

  • Random graphs

  • Algorithms

  • Model theory and descriptive complexity

  • Logical limit laws

  • Extreme value theory

Papers

Preprints

  1. M. Axenovich, L. Kießle, A. Sagdeev, M. Zhukovskii, Faces in girth-saturated graphs on surfaces, 2025
     

  2. M. Zhukovskii, Sharp thresholds for spanning regular subgraphs, 2025
     

  3. J. Sylvester, V. Zamaraev, M. Zhukovskii, Functionality of random graphs, 2024
     

  4. S. Diskin, I. Hoshen, M. Zhukovskii, Tree tilings in random regular graphs, 2024
     

  5. O. Verbitsky, M. Zhukovskii, Canonical labeling of sparse random graphs, 2024
     

  6. F. Fuhlbrück, J. Köbler, O. Verbitsky, M. Zhukovskii, Gathering information about a graph by counting walks from a single vertex, 2024

    ​

  7. M. Akhmejanova, V. Kozhevnikov, M. Zhukovskii, Maximum induced trees and forests of bounded degree in random graphs, 2024
     

  8. N. Terekhov, M. Zhukovskii, Weak saturation rank: a failure of linear algebraic approach to weak saturation, 2024
     

  9. T. Hershko, M. Zhukovskii, First order distinguishability of sparse random graphs, 2024
     

  10. S. Diskin, I. Hoshen, D. Korándi, B. Sudakov, M. Zhukovskii, Saturation in random hypergraphs, 2024
     

  11. M. Krivelevich, M. Zhukovskii, Reconstructing random graphs from distance queries, 2024
     

  12. I. Hoshen, W. Samotij, M. Zhukovskii, Stability of large cuts in random graphs, 2024
     

  13. D. Demin, M. Zhukovskii, First order complexity of finite random structures, 2024
     

  14. É. Bonnet, J. Duron, J. Sylvester, V. Zamaraev, M. Zhukovskii, Tight bounds on adjacency labels for monotone graph classes, 2023
     

  15. O. Verbitsky, M. Zhukovskii, Canonization of a random graph by two matrix-vector multiplications, 2023
     

  16. O. Verbitsky, M. Zhukovskii, Canonization of a random circulant graph by counting walks, 2023
     

  17. Y. Demidovich, Ya. Panichkin, M. Zhukovskii, Reconstruction of colours, 2023
     

  18. M. Miralaei, A. Mohammadian, B. Tayfeh-Rezaie, M. Zhukovskii, Saturation numbers of bipartite graphs in random graphs, 2023
     

  19. Yu. Malyshkin, M. Zhukovskii, Logical convergence laws via stochastic approximation and Markov processes, 2022
     

  20. I. Bogdanov, O. Grigoryan, M. Zhukovskii, Covering three-tori with cubes, 2021

Selected journal publications

  1. S. Diskin, I. Hoshen, M. Zhukovskii, A Jump of the Saturation Number in Random Graphs?, Random Structures & Algorithms (accepted)
     

  2. O. Pikhurko, O. Verbitsky, M. Zhukovskii, New bounds for the optimal density of covering single-insertion codes via the Turán density, IEEE Transactions on Information Theory (2025) doi: 10.1109/TIT.2025.3557393
     

  3. I. Benjamini, M. Zhukovskii,  A very sharp threshold for first order logic distinguishability of random graphs'', Discrete Analysis (accepted)
     

  4. M. Isaev, B. D. McKay, A. Southwell, M. Zhukovskii, Sprinkling with random regular graphs, Electronic Journal of Probability, 30:17 (2025) pp 1–20
     

  5. N. Terekhov, M. Zhukovskii, Weak saturation in graphs: a combinatorial approach, Journal of Combinatorial Theory B, 172 (2025) pp 146–167
     

  6. I. Benjamini, Y. Dikstein, R. Gross, M. Zhukovskii, Randomly twisted hypercubes - between structure and randomness, Random Structures & Algorithms, 66:1 (2025) e21267
     

  7. M. Isaev, M. Zhukovskii, On the maximum number of common neighbours in dense random regular graphs, European Journal of Combinatorics, 126 (2025) 104106
     

  8. É. Bonnet, J. Duron, J. Sylvester, V. Zamaraev, M. Zhukovskii, Small but unwieldy: A Lower Bound on Adjacency Labels for Small Classes, SIAM Journal on Computing, 53:5 (2024) pp 1578–1601
     

  9. S. Kiselev, A. Kupavskii, O. Verbitsky, M. Zhukovskii, On anti-stochastic properties of unlabeled graphs, SIAM Journal on Discrete Mathematics, 38:4 (2024) pp 3043–3078
     

  10. S. Vakhrushev, M. Zhukovskii, Maximum number of symmetric extensions in the random graph, SIAM Journal on Discrete Mathematics, 38:3 (2024) pp 2468–2488
     

  11. M. Krivelevich, M. Zhukovskii, Maximum chordal subgraphs of random graphs, Combinatorics, Probability and Computing, 33:5 (2024) pp 611–623

    ​

  12. M. Isaev, I. Rodionov, R. Zhang, M. Zhukovskii, Extremal independence in discrete random systems, Annales de l'Institut Henri Poincaré (B) 60:4 (2024) pp 2923–2944
     

  13. M.R. Bidgoli, A. Mohammadian, B. Tayfeh-Rezaie, M. Zhukovskii, Threshold for stability of weak saturation, Journal of Graph Theory, 106:3 (2024) pp 474–495
     

  14. Y. Yarovikov, M. Zhukovskii, Spectrum of FO logic with quantifier depth 4 is finite, ACM Transactions on Computational Logic, 25:2 (2024) pp 9:1–9:24
     

  15. S. Diskin, I. Hoshen, M. Krivelevich, M. Zhukovskii, On vertex Ramsey graphs with forbidden subgraphs, Discrete Mathematics, 347:3 (2024) 113806
     

  16. I. Benjamini, H. Helman Tov, M. Zhukovskii, Global information from local observations of the noisy voter model, Annals of Probability, 51:5 (2023) pp 1963–1992
     

  17. Y. Demidovich, M. Zhukovskii, Tight asymptotics of clique-chromatic numbers of dense random graphs, Journal of Graph Theory, 103:3 (2023) pp 451–461
     

  18. S. Demyanov, M. Zhukovskii, Tight concentration of star saturation number in random graphs, Discrete Mathematics, 346:10 (2023) 113572
     

  19. O. Kalinichenko, M. Zhukovskii, Weak saturation stability, European Journal of Combinatorics 114 (2023) 103777
     

  20. Yu. Demidovich, A. Skorkin, M. Zhukovskii, Cycle saturation in random graphs, SIAM Journal on Discrete Mathematics, 37:3 (2023) pp 1359–1385
     

  21. V. Kozhevnikov, M. Zhukovskii, Large cycles in generalized Johnson graphs, Journal of Graph Theory (2023) pp 1-15, published online
     

  22. I. Rodionov, M. Zhukovskii, The distribution of the maximum number of common neighbors in the random graph, European Journal of Combinatorics, 107 (2023) 103602
     

  23. M. Akhmejanova, M. Zhukovskii, EMSO(FO^2) 0-1 law fails for all dense random graphs, SIAM Journal on Discrete Mathematics, 36:3 (2022) 10.1137/21M1429655
     

  24. M. Podder, M. Zhukovskii, Zero-one laws for existential first order sentences of bounded quantifier depth, ACM Transactions on Computational Logic, 23:2 (2022) Article 12: 1–27
     

  25. M. Isaev, A. Southwell, M. Zhukovskii, Distribution of tree parameters by martingale approach, Combinatorics, Probability and Computing, 31:5 (2022) pp 737–764
     

  26. Y. Malyshkin, M. Zhukovskii, γ-variable first-order logic of uniform attachment random graphs, Discrete Mathematics, 345 (2022) 112802
     

  27. V. Kozhevnikov, A. Raigorodskii, M. Zhukovskii, Large cycles in random generalized Johnson graphs, Discrete Mathematics, 345:3 (2022) 112721
     

  28. J. Balogh, M. Zhukovskii, On the sizes of large subgraphs of the binomial random graph, Discrete Mathematics, 345:2 (2022) 112675
     

  29. D. Dmitriev, M. Zhukovskii, On a generalization of a Ramanujan conjecture for binomial random variables, Statistics & Probability Letters, 177 (2021) 109147
     

  30. D. Kamaldinov, A. Skorkin, M. Zhukovskii, Maximum sparse induced subgraphs of the binomial random graph with given number of edges, Discrete mathematics, 344:2 (2021) 112205
     

  31. Y. Malyshkin, M. Zhukovskii, MSO zero-one law for recursive random trees, Statistics & Probability Letters, 173 (2021), 109061
     

  32. M. Zhukovskii, Logical laws for short existential monadic second order sentences about graphs, Journal of Mathematical Logic, 2:2 (2020) 2050007
     

  33. A. Egorova, M. Zhukovskii, Existential monadic second order convergence law fails on sparse random graphs, European Journal of Combinatorics, 83 (2020) 103017
     

  34. S. Popova, M. Zhukovskii, Existential monadic second order logic of undirected graphs: a disproof of the Le Bars conjecture, Annals of Pure and Applied Logic, 170 (2019) pp 505–514
     

  35. O. Verbitsky, M. Zhukovskii, On the First-Order Complexity of Induced Subgraph Isomorphism, Logical Methods in Computer Science, 15:1 (2019) pp 25:1–25:24
     

  36. O. Verbitsky, M. Zhukovskii, Tight bounds on the asymptotic descriptive complexity of subgraph isomorphism, ACM Transactions on Computational Logic, 20:2 (2019) pp 9:1–9:18
     

  37. A. Matushkin, M. Zhukovskii, First order sentences about random graphs: small number of alternations, Discrete Applied Mathematics, 236 (2018) pp 329–346
     

  38. D. Dmitriev, M. Zhukovskii, On a connection of two graph-theoretic problems with conjectures of Ramanujan and Samuels, Russian Mathematical Surveys, 73:4 (2018) pp 173–174
     

  39. A. Kupavskii, M. Zhukovskii, Short monadic second order sentences about sparse random graphs, SIAM Journal on Discrete Mathematics, 32:4 (2018) pp 2916–2940
     

  40. M. Zhukovskii, On the zero-one k-law extensions, European Journal of Combinatorics, 60 (2017) pp 66–81
     

  41. L. Ostrovsky, M. Zhukovskii, Monadic second-order properties of very sparse random graphs, Annals of pure and applied logic, 168 (2017) pp 2087–2101
     

  42. J. Spencer, M. Zhukovskii, Bounded quantifier depth spectra for random graphs, Discrete Mathematics, 339:6 (2016) pp 1651–1664
     

  43. M. Zhukovskii, A. Raigorodskii, Random graphs: models and asymptotic characteristics, Russian Mathematical Surveys, 70:1 (2015) pp 33–81
     

  44. M. Zhukovskii, The Law of Large Numbers for the Number of Active Particles in an Epidemic Model, Theory of Probability & Its Applications. 58:2 (2014) pp 297–313
     

  45. M. Zhukovskii, Zero-One k-Law, Discrete Mathematics, 312 (2012) pp 1670–1688

Refereed publications in conference proceedings

  1. S. Diskin, I. Hoshen, M. Zhukovskii, Tiling Random Regular Graphs Efficiently, ICALP 2025 (The 51st EATCS International Colloquium on Automata, Languages, and Programming) accepted
     

  2. O. Verbitsky, M. Zhukovskii, Canonical labeling of sparse random graphs, STACS 2025 (42nd International Symposium on Theoretical Aspects of Computer Science) 75:1-75:20

     

  3. T. Hershko, M. Zhukovskii, First order distinguishability of sparse random graphs, LICS 2024 (The 39th Annual ACM/IEEE Symposium on Logic in Computer Science) 44:1-44:14
     

  4. D. Demin, M. Zhukovskii, First order complexity of finite random structures, LICS 2024 (The 39th Annual ACM/IEEE Symposium on Logic in Computer Science) 31:1-31:14
     

  5. É. Bonnet, J. Duron, J. Sylvester, V. Zamaraev, M. Zhukovskii, Tight bounds on adjacency labels for monotone graph classes, ICALP 2024 (The 51st EATCS International Colloquium on Automata, Languages, and Programming) 31:1-31:20
     

  6. O. Verbitsky, M. Zhukovskii, Canonization of a random circulant graph by counting walks, WALCOM 2024 (The 18th International Conference and Workshops on Algorithms and Computation) 319-334
     

  7. É. Bonnet, J. Duron, J. Sylvester, V. Zamaraev, M. Zhukovskii, Small but unwieldy: a lower bound on adjacency labels for small classes, SODA 2024 (ACM-SIAM Symposium on Discrete Algorithms) 1147-1165

    ​

  8. O. Verbitsky, M. Zhukovskii. Canonization of a random graph by two vector-matrix multiplications, ESA 2023 (The European Symposium on Algorithms), Amsterdam, Netherlands, September 2023. Best paper award
     

  9. S. Kiselev, A. Kupavskii, O. Verbitsky, M. Zhukovskii. On anti-stochastic properties of unlabeled graphs, WG 2022 (48th international Workshop on graph-theoretics concepts in Computer Science), Tübingen, Germany, June 2022
     

  10. I. Bogdanov, O. Grigoryan, M. Zhukovskii, Covering three-tori with cubes, Trends in Mathematics Research Perspectives CRM Barcelona Vol. 14, Extended Abstracts EuroComb 2021, 811-816
     

  11. Yu. Demidovich, M. Zhukovskii, Cycle saturation in random graphs, Trends in Mathematics Research Perspectives CRM Barcelona Vol. 14, Extended Abstracts EuroComb 2021, 772-777
     

  12. J. Balogh, M. Zhukovskii,  Maximum induced subgraphs of the binomial random graph, Abstracts to the talks at Eurocomb 2019, Bratislava, Slovakia, August, 2019
     

  13. O. Verbitsky, M. Zhukovskii, The Descriptive Complexity of Subgraph Isomorphism Without Numerics, CSR 2017: 308-322, Kazan, Russia, June, 2017
     

  14. M. Zhukovskii, Monotone convergence of the number of P_3 in G(n,p), SPA 2017 (39th Conference on Stochastic Processes and Their Applications): 128-129, Moscow, Russia, July, 2017
     

  15. O. Verbitsky, M. Zhukovskii, On the First-Order Complexity of Induced Subgraph Isomorphism, CSL 2017 (26th EACSL Annual Conference on Computer Science Logic), 40:1-40:16, Stockholm, Sweden, August 2017
     

  16. M. Zhukovskii, First order and monadic second order logic of very sparse random graphs, Abstracts to the talks at the international conference BGW 2016, Bordeaux, France, November, 2016
     

  17. L. Bogolubsky, P. Dvurechensky, A. Gasnikov, G. Gusev, Yu. Nesterov, A. Raigorodskii, A. Tikhonov, M. Zhukovskii, Learning Supervised PageRank with Gradient-Based and Gradient-Free Optimization Methods, NeurIPS 2016: 4907-4915, Spain, Barcelona, 2016
     

  18. M. Zhukovskii, T. Khatkevich, G. Gusev, P. Serdyukov, An Optimization Framework for Propagation of Query-Document Features by Query Similarity Functions, CIKM 2015: 981-990, Melbourne, Australia, 2015.
     

  19. M. Zhukovskii, G. Gusev, P. Serdyukov, Supervised Nested PageRank, CIKM 2014: 1059-1068, Shanghai, China, 2014.
     

  20. M. Zhukovskii, A, Khropov, G. Gusev, P. Serdyukov, Introducing search behavior into browsing based models of page's importance, WWW 2013: 129-130, Rio de Janeiro, Brazil, 13th-17th May, 2013.
     

  21. M. Zhukovskii, A. Khropov, G. Gusev, P. Serdyukov, Fresh BrowseRank, SIGIR 2013: 1029-1032, Dublin, Ireland, July, 2013.
     

  22. M. Zhukovskii, G. Gusev, P. Serdyukov, URL Redirection Accounting for Improving Link-Based Ranking Methods, ECIR 2013: 656-667, Moscow, Russia, March 2013.
     

  23. M. Zhukovskii, D. Vinogradov, G. Gusev, P. Serdyukov, A. Raigorodskii, Recency-sensitive model of web page authority, CIKM 2012: 2627-2630, Maui, Hawaii, USA, October-November 2012.
     

  24. M. Zhukovskii, D, Vinogradov, Yu. Pritykin, L. Ostroumova, E. Grechnikov, G. Gusev, P. Serdyukov, A. Raigorodskii, Empirical validation of the Buckley-Osthus model for the web host graph: degree and edge distributions, CIKM 2012: 1577-1581, Maui, Hawaii, USA, 2012.
     

  25. M. Zhukovskii, On the Weak Zero-One Laws for the Random Distance Graphs, Abstracts of the talks at the international conference Eurocomb 2009, Bordeaux, France, September, 2009.

Recent invited presentations

  1. The Midlands Graduate School Christmas Seminar, Sheffield, UK, 2024

    ​

  2. Probability meets Combinatorics at ISTA, Klosterneuburg, Austria, 2024

     

  3. Banff International Research Station "Bootstrap Percolation & Its Applications", Canada, 2024
     

  4. Probability in the North East, Sheffield, UK, 2023
     

  5. Dagstuhl Seminar 22061: Logic and Random Discrete Structures, Dagstuhl, Germany, 2022
     

  6. International conference Net 2019, Moscow, Russia, 2019
     

  7. 2nd Russian-Hungarian Combinatorial Workshop, Budapest, Hungary, 2018

Awards

  1. ESA best paper 2023
     

  2. Prize for Young Mathematicians of Russia 2021
     

  3. Robert Bartnik Visiting Fellowship, Monash University, 2019
     

  4. Fellowship of the Russian Academy of Sciences for young teachers and scientists, 2011
     

  5. Moscow State University Excellence Scholarship for undergraduate students, 2005 - 2009

bottom of page