M. E. Zhukovskii

From MaRDI portal
Person:265976

Available identifiers

zbMath Open zhukovskii.maximMaRDI QIDQ265976

List of research outcomes





PublicationDate of PublicationType
Extremal independence in discrete random systems2025-01-15Paper
Canonization of a random graph by two matrix-vector multiplications2025-01-06Paper
On isomorphism-invariant antistochastic properties of random graphs2024-12-18Paper
Small but unwieldy: a lower bound on adjacency labels for small classes2024-11-28Paper
Saturation in Kneser graphs2024-11-12Paper
Small but unwieldy: a lower bound on adjacency labels for small classes2024-11-01Paper
Maximum number of symmetric extensions in random graphs2024-10-22Paper
Maximum induced subgraphs of the binomial random graph2024-10-18Paper
On modeling radiation-induced charge effects in objects of complex geometry2024-08-21Paper
Canonization of a random circulant graph by counting walks2024-07-19Paper
Threshold for stability of weak saturation2024-05-15Paper
Spectrum of FO logic with quantifier depth 4 is finite2024-04-26Paper
Global information from local observations of the noisy voter model on a graph2024-01-23Paper
On vertex Ramsey graphs with forbidden subgraphs2024-01-17Paper
On the maximum number of common neighbours in dense random regular graphs2023-12-23Paper
Large cycles in generalized Johnson graphs2023-11-06Paper
Tight asymptotics of clique‐chromatic numbers of dense random graphs2023-10-12Paper
Sprinkling with random regular graphs2023-08-31Paper
Cycle Saturation in Random Graphs2023-08-10Paper
Reconstruction of graph colourings2023-08-03Paper
Weakly saturated subgraphs of random graphs2023-07-10Paper
Maximum number of symmetric extensions in the random graph2023-06-09Paper
Weak saturation in graphs: a combinatorial approach2023-05-18Paper
On anti-stochastic properties of unlabeled graphs2023-05-05Paper
Saturation numbers of bipartite graphs in random graphs2023-04-16Paper
Distribution of tree parameters by martingale approach2023-03-31Paper
Sharp thresholds for spanning regular graphs2023-01-10Paper
Randomly twisted hypercubes -- between structure and randomness2022-11-13Paper
Logical convergence laws via stochastic approximation and Markov processes2022-10-24Paper
The distribution of the maximum number of common neighbors in the random graph2022-10-07Paper
EMSO(FO$^2$) 0-1 Law Fails for All Dense Random Graphs2022-08-18Paper
A very sharp threshold for first order logic distinguishability of random graphs2022-07-23Paper
Behavior of binomial distribution near its median2022-07-15Paper
On the 4-spectrum of first-order properties of random graphs2022-03-18Paper
Zero-One Laws for Existential First-Order Sentences of Bounded Quantifier Depth2022-02-24Paper
Large cycles in random generalized Johnson graphs2022-01-13Paper
Covering three-tori with cubes2021-12-22Paper
On the sizes of large subgraphs of the binomial random graph2021-11-23Paper
On monotonicity of Ramanujan function for binomial random variables2021-11-12Paper
Minimum clique-free subgraphs of Kneser graphs2021-11-11Paper
Logical complexity of induced subgraph isomorphism for certain families of graphs2021-07-21Paper
Extremal independence in discrete random systems2021-05-11Paper
Maximum sparse induced subgraphs of the binomial random graph with given number of edges2020-12-04Paper
First-order definitions of subgraph isomorphism through the adjacency and order relations2020-11-10Paper
First-order zero-one law for the uniform model of the random graph2020-09-22Paper
Logical laws for short existential monadic second-order sentences about graphs2020-09-04Paper
On a Category of Cotangent Sums Related to the Nyman-Beurling Criterion for the Riemann Hypothesis2020-07-01Paper
The median of the number of simple paths on three vertices in the random graph2020-06-26Paper
Quantifier alternation in first-order formulas with infinite spectra2020-06-23Paper
Threshold for weak saturation stability2020-06-11Paper
On the First-Order Complexity of Induced Subgraph Isomorphism2020-05-26Paper
Zero-one laws for \(k\)-variable first-order logic of sparse random graphs2020-04-01Paper
Existential monadic second order convergence law fails on sparse random graphs2019-11-28Paper
Zero-one laws for sentences with \(k\) variables2019-11-01Paper
The descriptive complexity of subgraph isomorphism without numerics2019-07-04Paper
Tight Bounds on the Asymptotic Descriptive Complexity of Subgraph Isomorphism2019-07-04Paper
Disproof of the zero-one law for existential monadic properties of a sparse binomial random graph2019-06-24Paper
On a connection of two graph-theoretic problems with conjectures of Ramanujan and Samuels2019-05-23Paper
https://portal.mardi4nfdi.de/entity/Q31215272019-03-18Paper
On the distribution of the maximum \(k\)-degrees of the binomial random graph2019-03-15Paper
Logical complexity of induced subgraph isomorphism for certain graph families2019-02-10Paper
Short Monadic Second Order Sentences about Sparse Random Graphs2018-12-19Paper
Small subgraphs and their extensions in a random distance graph2018-06-22Paper
About the Power Law of the PageRank Vector Component Distribution. Part 2. The Buckley–Osthus Model, Verification of the Power Law for This Model, and Setup of Real Search Engines2018-04-20Paper
Logical laws for existential monadic second-order sentences with infinite first-order parts2018-03-28Paper
First-order properties of bounded quantifier depth of very sparse random graphs2018-02-27Paper
Upper bound for the minimal quantifier depth of the first part of a monadic second-order sentence without asymptotic probability2018-02-07Paper
On first-order definitions of subgraph isomorphism properties2018-01-22Paper
First order sentences about random graphs: small number of alternations2018-01-11Paper
Spectra of first-order formulas with a low quantifier depth and a small number of quantifier alternations2017-10-25Paper
On infinite spectra of first-order properties of random graphs2017-09-20Paper
Monadic second-order properties of very sparse random graphs2017-09-19Paper
The descriptive complexity of subgraph isomorphism without numerics2017-08-22Paper
Spectra of short monadic sentences about sparse random graphs2017-06-15Paper
First-order and monadic properties of highly sparse random graphs2017-02-27Paper
On the zero-one \(k\)-law extensions2016-11-07Paper
When does the zero-one \(k\)-law fail?2016-10-18Paper
Universal zero-one \(k\)-law2016-10-18Paper
The spectra of first-order formulae having low quantifier rank2016-08-03Paper
On limit points of spectra of the random graph first-order properties2016-04-13Paper
Bounded quantifier depth spectra for random graphs2016-04-08Paper
Learning Supervised PageRank with Gradient-Based and Gradient-Free Optimization Methods2016-03-02Paper
On the spectra of first-order language properties for random graphs2015-11-12Paper
The largest critical point in the zero-one k-law2015-07-27Paper
On the zero-one 4-law for the Erdős-Rényi random graphs2015-07-16Paper
Random graphs: models and asymptotic characteristics2015-07-13Paper
On the convergence of probabilities of the random graph properties expressed by first-order formulae with a bounded quantifier depth2015-01-26Paper
Learning Supervised PageRank with Gradient-Free Optimization Methods2014-11-16Paper
Extension of the zero-one \(k\)-law2014-08-29Paper
The law of large numbers for the number of active particles in an epidemic model2014-08-27Paper
Estimation of the number of maximal extensions in a random graph2013-04-29Paper
On the probability of the occurrence of a copy of a fixed graph in a random distance graph2013-04-15Paper
Extension of zero-one k-law2013-04-03Paper
A weak zero-one law for sequences of random distance graphs2012-11-23Paper
Zero-one \(k\)-law2012-05-30Paper
Law of large numbers in an epidemic model2012-05-10Paper
On a sequence of random distance graphs subject to the zero-one law2012-03-13Paper
Zero-one laws for first-order formulas with a bounded quantifier depth2012-01-17Paper
The Weak Zero-One Law for the Random Distance Graphs2011-08-09Paper
The weak zero-one laws for the random distance graphs2010-11-17Paper
A Jump of the Saturation Number in Random Graphs?N/APaper
Small But Unwieldy: A Lower Bound on Adjacency Labels for Small ClassesN/APaper
Maximum chordal subgraphs of random graphsN/APaper
Tight bounds on adjacency labels for monotone graph classesN/APaper
First order complexity of finite random structuresN/APaper
Stability of large cuts in random graphsN/APaper
Reconstructing random graphs from distance queriesN/APaper
Saturation in Random HypergraphsN/APaper

Research outcomes over time

This page was built for person: M. E. Zhukovskii