Publication | Date of Publication | Type |
---|
On the typical structure of graphs not containing a fixed vertex-critical subgraph | 2024-11-20 | Paper |
What does a typical metric space look like? | 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 | 2023-06-12 | Paper |
The list-Ramsey threshold for families of graphs | 2023-05-31 | Paper |
Lower tails via relative entropy | 2023-05-10 | Paper |
Two-round Ramsey games on random graphs | 2023-05-04 | Paper |
Upper tails via high moments and entropic stability | 2022-08-22 | Paper |
Sharp thresholds for Ramsey properties | 2022-07-28 | Paper |
On the counting problem in inverse Littlewood–Offord theory | 2021-08-13 | Paper |
Towards the Kohayakawa–Kreuter conjecture on asymmetric Ramsey properties | 2021-06-15 | Paper |
An efficient container lemma | 2021-01-16 | Paper |
THE METHOD OF HYPERGRAPH CONTAINERS | 2020-09-22 | Paper |
A generalized Turán problem in random graphs | 2020-06-19 | Paper |
On the probability of nonexistence in binomial subsets | 2020-05-29 | Paper |
Supersaturated Sparse Graphs and Hypergraphs | 2020-02-17 | Paper |
Packing trees of unbounded degrees in random graphs | 2019-07-11 | Paper |
https://portal.mardi4nfdi.de/entity/Q5743497 | 2019-05-10 | Paper |
Subsets of posets minimising the number of chains | 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 | 2018-04-10 | Paper |
On the Number ofBh-Sets | 2017-10-04 | Paper |
The number of additive triples in subsets of abelian groups | 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\) | 2017-02-24 | Paper |
The number of \(B_3\)-sets of a given cardinality | 2016-05-18 | Paper |
The typical structure of sparse $K_{r+1}$-free graphs | 2016-03-08 | Paper |
Smoothed Analysis on Connected Graphs | 2015-09-23 | Paper |
On the number of monotone sequences | 2015-08-21 | Paper |
Counting independent sets in graphs | 2015-06-02 | Paper |
Independent sets in hypergraphs | 2015-04-27 | Paper |
The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers | 2015-02-20 | Paper |
On the KŁR conjecture in random graphs | 2014-12-02 | Paper |
Grounded Lipschitz functions on trees are typically flat | 2014-09-22 | Paper |
Odd cutsets and the hard-core model on \(\mathbb{Z}^{d}\) | 2014-09-05 | Paper |
Long paths and cycles in random subgraphs of \(\mathcal{H}\)-free graphs | 2014-09-04 | Paper |
Counting sum-free sets in abelian groups | 2014-06-25 | Paper |
Random sum-free subsets of abelian groups | 2014-06-25 | Paper |
Stability results for random discrete structures | 2014-05-13 | Paper |
A refinement of the Cameron-Erdős conjecture | 2014-02-28 | Paper |
Lipschitz Functions on Expanders are Typically Flat | 2013-07-26 | Paper |
Expanders Are Universal for the Class of All Spanning Trees | 2013-03-14 | Paper |
Optimal Packings of Hamilton Cycles in Sparse Random Graphs | 2013-01-04 | Paper |
Pancyclic subgraphs of random graphs | 2012-09-12 | Paper |
Corrádi and Hajnal's Theorem for Sparse Random Graphs | 2012-05-14 | Paper |
The number of \(K_{m,m}\)-free graphs | 2011-12-20 | Paper |
Almost All $C_4$-Free Graphs Have Fewer than $(1-\varepsilon)\,\mathrm{ex}(n,C_4)$ Edges | 2011-06-17 | Paper |
On the Chvàtal-Erdős triangle game | 2011-06-01 | Paper |
The number of K s,t -free graphs | 2011-04-08 | Paper |
Local resilience of almost spanning trees in random graphs | 2011-01-17 | Paper |
Sizes of Induced Subgraphs of Ramsey Graphs | 2010-04-22 | Paper |
Large bounded degree trees in expanding graphs | 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 |