| Publication | Date of Publication | Type |
|---|
On the typical structure of graphs not containing a fixed vertex-critical subgraph
Random Structures & Algorithms | 2024-11-20 | Paper |
What does a typical metric space look like?
Annales de l'Institut Henri Poincaré. Probabilités et Statistiques | 2024-04-12 | Paper |
Simonovits's theorem in random graphs
| 2023-08-25 | Paper |
On the Kohayakawa-Kreuter conjecture
| 2023-07-31 | Paper |
Largest subgraph from a hereditary property in a random graph
Discrete Mathematics | 2023-06-12 | Paper |
The list-Ramsey threshold for families of graphs
| 2023-05-31 | Paper |
Lower tails via relative entropy
The Annals of Probability | 2023-05-10 | Paper |
Two-round Ramsey games on random graphs
| 2023-05-04 | Paper |
Upper tails via high moments and entropic stability
Duke Mathematical Journal | 2022-08-22 | Paper |
Sharp thresholds for Ramsey properties
| 2022-07-28 | Paper |
On the counting problem in inverse Littlewood-Offord theory
Journal of the London Mathematical Society | 2021-08-13 | Paper |
Towards the Kohayakawa-Kreuter conjecture on asymmetric Ramsey properties
Combinatorics, Probability and Computing | 2021-06-15 | Paper |
An efficient container lemma
discrete Analysis | 2021-01-16 | Paper |
The method of hypergraph containers
Proceedings of the International Congress of Mathematicians (ICM 2018) | 2020-09-22 | Paper |
A generalized Turán problem in random graphs
Random Structures & Algorithms | 2020-06-19 | Paper |
On the probability of nonexistence in binomial subsets
The Annals of Probability | 2020-05-29 | Paper |
Supersaturated sparse graphs and hypergraphs
IMRN. International Mathematics Research Notices | 2020-02-17 | Paper |
Packing trees of unbounded degrees in random graphs
Journal of the London Mathematical Society | 2019-07-11 | Paper |
Expanders are universal for the class of all spanning trees
| 2019-05-10 | Paper |
Subsets of posets minimising the number of chains
Transactions of the American Mathematical Society | 2019-05-06 | Paper |
An asymmetric container lemma and the structure of graphs with no induced $4$-cycle
| 2018-06-10 | Paper |
The number of Bh‐sets of a given cardinality
Proceedings of the London Mathematical Society | 2018-04-10 | Paper |
On the number of \(B_h\)-sets
Combinatorics, Probability and Computing | 2017-10-04 | Paper |
The number of additive triples in subsets of abelian groups
Mathematical Proceedings of the Cambridge Philosophical Society | 2017-09-28 | Paper |
Smoothed Analysis on Connected Graphs
| 2017-03-22 | Paper |
Exponential decay of loop lengths in the loop \(\mathrm{O}(n)\) model with large \(n\)
Communications in Mathematical Physics | 2017-02-24 | Paper |
The number of \(B_3\)-sets of a given cardinality
Journal of Combinatorial Theory. Series A | 2016-05-18 | Paper |
The typical structure of sparse \(K_{r+1}\)-free graphs
Transactions of the American Mathematical Society | 2016-03-08 | Paper |
Smoothed Analysis on Connected Graphs
SIAM Journal on Discrete Mathematics | 2015-09-23 | Paper |
On the number of monotone sequences
Journal of Combinatorial Theory. Series B | 2015-08-21 | Paper |
Counting independent sets in graphs
European Journal of Combinatorics | 2015-06-02 | Paper |
Independent sets in hypergraphs
Journal of the American Mathematical Society | 2015-04-27 | Paper |
The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers
Random Structures & Algorithms | 2015-02-20 | Paper |
On the KŁR conjecture in random graphs
Israel Journal of Mathematics | 2014-12-02 | Paper |
Grounded Lipschitz functions on trees are typically flat
Electronic Communications in Probability | 2014-09-22 | Paper |
Odd cutsets and the hard-core model on \(\mathbb{Z}^{d}\)
Annales de l'Institut Henri Poincaré. Probabilités et Statistiques | 2014-09-05 | Paper |
Long paths and cycles in random subgraphs of \(\mathcal{H}\)-free graphs
The Electronic Journal of Combinatorics | 2014-09-04 | Paper |
Counting sum-free sets in abelian groups
Israel Journal of Mathematics | 2014-06-25 | Paper |
Random sum-free subsets of abelian groups
Israel Journal of Mathematics | 2014-06-25 | Paper |
Stability results for random discrete structures
Random Structures & Algorithms | 2014-05-13 | Paper |
A refinement of the Cameron-Erdős conjecture
Proceedings of the London Mathematical Society | 2014-02-28 | Paper |
Lipschitz functions on expanders are typically flat
Combinatorics, Probability and Computing | 2013-07-26 | Paper |
Expanders Are Universal for the Class of All Spanning Trees
Combinatorics, Probability and Computing | 2013-03-14 | Paper |
Optimal packings of Hamilton cycles in sparse random graphs
SIAM Journal on Discrete Mathematics | 2013-01-04 | Paper |
Pancyclic subgraphs of random graphs
Journal of Graph Theory | 2012-09-12 | Paper |
Corrádi and Hajnal's theorem for sparse random graphs
Combinatorics, Probability and Computing | 2012-05-14 | Paper |
The number of \(K_{m,m}\)-free graphs
Combinatorica | 2011-12-20 | Paper |
Almost all \(C_4\)-free graphs have fewer than \((1-\varepsilon)\,\text{ex}(n,C_4)\) edges
SIAM Journal on Discrete Mathematics | 2011-06-17 | Paper |
On the Chvàtal-Erdős triangle game
The Electronic Journal of Combinatorics | 2011-06-01 | Paper |
The number of \(K_{s,t}\)-free graphs
Journal of the London Mathematical Society | 2011-04-08 | Paper |
Local resilience of almost spanning trees in random graphs
Random Structures & Algorithms | 2011-01-17 | Paper |
Sizes of induced subgraphs of Ramsey graphs
Combinatorics, Probability and Computing | 2010-04-22 | Paper |
Large bounded degree trees in expanding graphs
The Electronic Journal of Combinatorics | 2010-03-26 | Paper |
On the typical structure of graphs not containing a fixed vertex-critical subgraph
| N/A | Paper |
Stability of large cuts in random graphs
| N/A | Paper |
