| Publication | Date of Publication | Type |
|---|
| Tight bounds on adjacency labels for monotone graph classes | 2026-01-14 | Paper |
Maximum chordal subgraphs of random graphs
Combinatorics, Probability and Computing | 2025-12-16 | Paper |
Weak saturation rank: a failure of the linear algebraic approach to weak saturation
Combinatorica | 2025-12-08 | Paper |
Logical convergence laws via stochastic approximation and Markov processes
Electronic Journal of Probability | 2025-11-01 | Paper |
A very sharp threshold for first order logic distinguishability of random graphs
Discrete Analysis | 2025-09-19 | Paper |
Extremal independence in discrete random systems
Annales de l'Institut Henri Poincaré. Probabilités et Statistiques | 2025-01-15 | Paper |
| Canonization of a random graph by two matrix-vector multiplications | 2025-01-06 | Paper |
On isomorphism-invariant antistochastic properties of random graphs
SIAM Journal on Discrete Mathematics | 2024-12-18 | Paper |
| Small but unwieldy: a lower bound on adjacency labels for small classes | 2024-11-28 | Paper |
Saturation in Kneser graphs
Mathematical Notes | 2024-11-12 | Paper |
Small but unwieldy: a lower bound on adjacency labels for small classes
SIAM Journal on Computing | 2024-11-01 | Paper |
Maximum number of symmetric extensions in random graphs
SIAM Journal on Discrete Mathematics | 2024-10-22 | Paper |
Maximum induced subgraphs of the binomial random graph
Acta Mathematica Universitatis Comenianae. New Series | 2024-10-18 | Paper |
On modeling radiation-induced charge effects in objects of complex geometry
Mathematica Montisnigri | 2024-08-21 | Paper |
| Canonization of a random circulant graph by counting walks | 2024-07-19 | Paper |
Threshold for stability of weak saturation
Journal of Graph Theory | 2024-05-15 | Paper |
Spectrum of FO logic with quantifier depth 4 is finite
ACM Transactions on Computational Logic | 2024-04-26 | Paper |
Global information from local observations of the noisy voter model on a graph
The Annals of Probability | 2024-01-23 | Paper |
On vertex Ramsey graphs with forbidden subgraphs
Discrete Mathematics | 2024-01-17 | Paper |
| On the maximum number of common neighbours in dense random regular graphs | 2023-12-23 | Paper |
Large cycles in generalized Johnson graphs
Journal of Graph Theory | 2023-11-06 | Paper |
Tight asymptotics of clique‐chromatic numbers of dense random graphs
Journal of Graph Theory | 2023-10-12 | Paper |
| Sprinkling with random regular graphs | 2023-08-31 | Paper |
Cycle Saturation in Random Graphs
SIAM Journal on Discrete Mathematics | 2023-08-10 | Paper |
| Reconstruction of graph colourings | 2023-08-03 | Paper |
Weakly saturated subgraphs of random graphs
Doklady Mathematics | 2023-07-10 | Paper |
| Maximum number of symmetric extensions in the random graph | 2023-06-09 | Paper |
| Weak saturation in graphs: a combinatorial approach | 2023-05-18 | Paper |
On anti-stochastic properties of unlabeled graphs
Graph-Theoretic Concepts in Computer Science | 2023-05-05 | Paper |
| Saturation numbers of bipartite graphs in random graphs | 2023-04-16 | Paper |
Distribution of tree parameters by martingale approach
Combinatorics, Probability and Computing | 2023-03-31 | Paper |
| Sharp thresholds for spanning regular graphs | 2023-01-10 | Paper |
| Randomly twisted hypercubes -- between structure and randomness | 2022-11-13 | Paper |
| Logical convergence laws via stochastic approximation and Markov processes | 2022-10-24 | Paper |
The distribution of the maximum number of common neighbors in the random graph
European Journal of Combinatorics | 2022-10-07 | Paper |
EMSO(FO$^2$) 0-1 Law Fails for All Dense Random Graphs
SIAM Journal on Discrete Mathematics | 2022-08-18 | Paper |
| A very sharp threshold for first order logic distinguishability of random graphs | 2022-07-23 | Paper |
Behavior of binomial distribution near its median
Doklady Mathematics | 2022-07-15 | Paper |
On the 4-spectrum of first-order properties of random graphs
Doklady Mathematics | 2022-03-18 | Paper |
Zero-one laws for existential first-order sentences of bounded quantifier depth
ACM Transactions on Computational Logic | 2022-02-24 | Paper |
Large cycles in random generalized Johnson graphs
Discrete Mathematics | 2022-01-13 | Paper |
| Covering three-tori with cubes | 2021-12-22 | Paper |
On the sizes of large subgraphs of the binomial random graph
Discrete Mathematics | 2021-11-23 | Paper |
On monotonicity of Ramanujan function for binomial random variables
Statistics & Probability Letters | 2021-11-12 | Paper |
Minimum clique-free subgraphs of Kneser graphs
Doklady Mathematics | 2021-11-11 | Paper |
Logical complexity of induced subgraph isomorphism for certain families of graphs
Sbornik: Mathematics | 2021-07-21 | Paper |
| Extremal independence in discrete random systems | 2021-05-11 | Paper |
Maximum sparse induced subgraphs of the binomial random graph with given number of edges
Discrete Mathematics | 2020-12-04 | Paper |
First-order definitions of subgraph isomorphism through the adjacency and order relations
Moscow Journal of Combinatorics and Number Theory | 2020-11-10 | Paper |
First-order zero-one law for the uniform model of the random graph
Sbornik: Mathematics | 2020-09-22 | Paper |
Logical laws for short existential monadic second-order sentences about graphs
Journal of Mathematical Logic | 2020-09-04 | Paper |
On a category of cotangent sums related to the Nyman-Beurling criterion for the Riemann hypothesis
Trigonometric Sums and Their Applications | 2020-07-01 | Paper |
The median of the number of simple paths on three vertices in the random graph
Mathematical Notes | 2020-06-26 | Paper |
Quantifier alternation in first-order formulas with infinite spectra
Problems of Information Transmission | 2020-06-23 | Paper |
| Threshold for weak saturation stability | 2020-06-11 | Paper |
On the first-order complexity of induced subgraph isomorphism
(available as arXiv preprint) | 2020-05-26 | Paper |
Zero-one laws for \(k\)-variable first-order logic of sparse random graphs
Discrete Applied Mathematics | 2020-04-01 | Paper |
Existential monadic second order convergence law fails on sparse random graphs
European Journal of Combinatorics | 2019-11-28 | Paper |
Zero-one laws for sentences with \(k\) variables
Doklady Mathematics | 2019-11-01 | Paper |
The descriptive complexity of subgraph isomorphism without numerics
Theory of Computing Systems | 2019-07-04 | Paper |
Tight bounds on the asymptotic descriptive complexity of subgraph isomorphism
ACM Transactions on Computational Logic | 2019-07-04 | Paper |
Disproof of the zero-one law for existential monadic properties of a sparse binomial random graph
Doklady Mathematics | 2019-06-24 | Paper |
On a connection of two graph-theoretic problems with conjectures of Ramanujan and Samuels
Russian Mathematical Surveys | 2019-05-23 | Paper |
On the first-order complexity of induced subgraph isomorphism
(available as arXiv preprint) | 2019-03-18 | Paper |
On the distribution of the maximum \(k\)-degrees of the binomial random graph
Doklady Mathematics | 2019-03-15 | Paper |
| Logical complexity of induced subgraph isomorphism for certain graph families | 2019-02-10 | Paper |
Short monadic second order sentences about sparse random graphs
SIAM Journal on Discrete Mathematics | 2018-12-19 | Paper |
Small subgraphs and their extensions in a random distance graph
Sbornik: Mathematics | 2018-06-22 | Paper |
About the power law of the PageRank vector component distribution. II: The Buckley-Osthus model, verification of the power law for this model, and setup of real search engines
Numerical Analysis and Applications | 2018-04-20 | Paper |
Logical laws for existential monadic second-order sentences with infinite first-order parts
Doklady Mathematics | 2018-03-28 | Paper |
First-order properties of bounded quantifier depth of very sparse random graphs
Izvestiya: Mathematics | 2018-02-27 | Paper |
| Upper bound for the minimal quantifier depth of the first part of a monadic second-order sentence without asymptotic probability | 2018-02-07 | Paper |
On first-order definitions of subgraph isomorphism properties
Doklady Mathematics | 2018-01-22 | Paper |
First order sentences about random graphs: small number of alternations
Discrete Applied Mathematics | 2018-01-11 | Paper |
Spectra of first-order formulas with a low quantifier depth and a small number of quantifier alternations
Doklady Mathematics | 2017-10-25 | Paper |
On infinite spectra of first-order properties of random graphs
Moscow Journal of Combinatorics and Number Theory | 2017-09-20 | Paper |
On infinite spectra of first-order properties of random graphs
Moscow Journal of Combinatorics and Number Theory | 2017-09-20 | Paper |
Monadic second-order properties of very sparse random graphs
Annals of Pure and Applied Logic | 2017-09-19 | Paper |
The descriptive complexity of subgraph isomorphism without numerics
Lecture Notes in Computer Science | 2017-08-22 | Paper |
Spectra of short monadic sentences about sparse random graphs
Doklady Mathematics | 2017-06-15 | Paper |
First-order and monadic properties of highly sparse random graphs
Doklady Mathematics | 2017-02-27 | Paper |
On the zero-one \(k\)-law extensions
European Journal of Combinatorics | 2016-11-07 | Paper |
When does the zero-one \(k\)-law fail?
Mathematical Notes | 2016-10-18 | Paper |
Universal zero-one \(k\)-law
Mathematical Notes | 2016-10-18 | Paper |
The spectra of first-order formulae having low quantifier rank
Russian Mathematical Surveys | 2016-08-03 | Paper |
On limit points of spectra of the random graph first-order properties
Doklady Mathematics | 2016-04-13 | Paper |
Bounded quantifier depth spectra for random graphs
Discrete Mathematics | 2016-04-08 | Paper |
| Learning Supervised PageRank with Gradient-Based and Gradient-Free Optimization Methods | 2016-03-02 | Paper |
On the spectra of first-order language properties for random graphs
Doklady Mathematics | 2015-11-12 | Paper |
The largest critical point in the zero-one k-law
Sbornik: Mathematics | 2015-07-27 | Paper |
On the zero-one 4-law for the Erdős-Rényi random graphs
Mathematical Notes | 2015-07-16 | Paper |
Random graphs: models and asymptotic characteristics
Russian Mathematical Surveys | 2015-07-13 | Paper |
On the convergence of probabilities of the random graph properties expressed by first-order formulae with a bounded quantifier depth
Moscow Journal of Combinatorics and Number Theory | 2015-01-26 | Paper |
| Learning Supervised PageRank with Gradient-Free Optimization Methods | 2014-11-16 | Paper |
Extension of the zero-one \(k\)-law
Doklady Mathematics | 2014-08-29 | Paper |
The law of large numbers for the number of active particles in an epidemic model
Theory of Probability and its Applications | 2014-08-27 | Paper |
Estimation of the number of maximal extensions in a random graph
Discrete Mathematics and Applications | 2013-04-29 | Paper |
On the probability of the occurrence of a copy of a fixed graph in a random distance graph
Mathematical Notes | 2013-04-15 | Paper |
| Extension of zero-one k-law | 2013-04-03 | Paper |
A weak zero-one law for sequences of random distance graphs
Sbornik: Mathematics | 2012-11-23 | Paper |
Zero-one \(k\)-law
Discrete Mathematics | 2012-05-30 | Paper |
Law of large numbers in an epidemic model
Doklady Mathematics | 2012-05-10 | Paper |
On a sequence of random distance graphs subject to the zero-one law
Problems of Information Transmission | 2012-03-13 | Paper |
Zero-one laws for first-order formulas with a bounded quantifier depth
Doklady Mathematics | 2012-01-17 | Paper |
The weak zero-one law for the random distance graphs
Theory of Probability & Its Applications | 2011-08-09 | Paper |
The weak zero-one laws for the random distance graphs
Doklady Mathematics | 2010-11-17 | Paper |
A Jump of the Saturation Number in Random Graphs?
(available as arXiv preprint) | N/A | Paper |
Small But Unwieldy: A Lower Bound on Adjacency Labels for Small Classes
(available as arXiv preprint) | N/A | Paper |
Maximum chordal subgraphs of random graphs
(available as arXiv preprint) | N/A | Paper |
Tight bounds on adjacency labels for monotone graph classes
(available as arXiv preprint) | N/A | Paper |
First order complexity of finite random structures
(available as arXiv preprint) | N/A | Paper |
Stability of large cuts in random graphs
(available as arXiv preprint) | N/A | Paper |
Reconstructing random graphs from distance queries
(available as arXiv preprint) | N/A | Paper |
Saturation in Random Hypergraphs
(available as arXiv preprint) | N/A | Paper |
