Dr Maksim Zhukovskii

简介

Maksim is a mathematician working mainly in combinatorics, probability, model theory and related areas. Before joining the Department of Computer Science, in December 2022, Maksim held research visiting positions in Tel Aviv University and Weizmann Institute of Science, Israel. Before that, he was Associate Professor at the department of Discrete Mathematics at Moscow Institute of Physics and Technology. Maksim received his PhD (2012) in mathematics from Moscow State University, Russia.

代表成果

• Akhmejanova M, Kozhevnikov V & Zhukovskii M (2026) Maximum Induced Trees and Forests of Bounded Degree in Random Graphs. Random Structures & Algorithms, 68(4).
• Bogdanov II, Grigoryan O & Zhukovskii M (2026) Covering three-tori with cubes. Australasian Journal of Combinatorics, 95, 33-48.
• Diskin S, Hoshen I, Korándi D, Sudakov B & Zhukovskii M (2025) Saturation in random hypergraphs. Combinatorics, Probability and Computing. View this article in WRRO
• Terekhov N & Zhukovskii M (2025) Weak saturation rank: a failure of the linear algebraic approach to weak saturation. Combinatorica, 45(5). View this article in WRRO
• Miralaei M, Mohammadian A, Tayfeh-Rezaie B & Zhukovskii M (2025) Saturation numbers of bipartite graphs in random graphs. Discrete Mathematics, 348(9), 114561-114561.
• Benjamini I & Zhukovskii M (2025) A very sharp threshold for first order logic distinguishability of random graphs. Discrete Analysis, 2025. View this article in WRRO
• Diskin S, Hoshen I & Zhukovskii M (2025) A jump of the saturation number in random graphs?. Random Structures & Algorithms, 66(4). View this article in WRRO
• Isaev M & Zhukovskii M (2025) On the maximum number of common neighbours in dense random regular graphs. European Journal of Combinatorics, 126, 104106-104106.
• Pikhurko O, Verbitsky O & Zhukovskii M (2025) New Bounds for the Optimal Density of Covering Single-Insertion Codes via the Turán Density. IEEE Transactions on Information Theory, 71(6), 4260-4266.
• Terekhov N & Zhukovskii M (2025) Weak saturation in graphs: A combinatorial approach. Journal of Combinatorial Theory, Series B, 172, 146-167. View this article in WRRO