| Publication | Date of Publication | Type |
|---|
| A counterexample to a directed KKL inequality | 2024-11-09 | Paper |
| Antichain codes | 2023-12-18 | Paper |
| Clique Supersaturation | 2023-12-13 | Paper |
| Colouring random subgraphs | 2023-12-13 | Paper |
| Friendly bisections of random graphs | 2023-10-17 | Paper |
| Down‐set thresholds | 2023-10-17 | Paper |
| Subgraphs of large connectivity and chromatic number | 2023-08-18 | Paper |
| On symmetric intersecting families of vectors | 2023-03-30 | Paper |
| Simplicial homeomorphs and trace-bounded hypergraphs | 2023-01-18 | Paper |
| Reconstructing random pictures | 2022-10-17 | Paper |
| A Counterexample to a Directed KKL Inequality | 2022-10-05 | Paper |
| Spanning surfaces in \(3\)-graphs | 2022-03-29 | Paper |
| Turán theorems for unavoidable patterns | 2022-03-17 | Paper |
| Applications of Random Algebraic Constructions to Hardness of Approximation | 2021-11-09 | Paper |
| Thresholds versus fractional expectation-thresholds | 2021-09-15 | Paper |
| A universal exponent for homeomorphs | 2021-08-24 | Paper |
| The threshold for the square of a Hamilton cycle | 2021-06-10 | Paper |
| Coppersmith's lattices and ``focus groups: an attack on small-exponent RSA | 2021-03-09 | Paper |
| Counting independent sets in regular hypergraphs | 2021-02-22 | Paper |
| Exceptional graphs for the random walk | 2021-02-15 | Paper |
| Sharp estimates for spanning trees | 2021-02-02 | Paper |
| Disproportionate division | 2020-11-20 | Paper |
| Sharp thresholds for nonlinear Hamiltonian cycles in hypergraphs | 2020-09-16 | Paper |
| Slowdown for the geodesic-biased random walk | 2019-12-12 | Paper |
| Product-free sets in the free semigroup | 2019-11-28 | Paper |
| Ramsey graphs induce subgraphs of many different sizes | 2019-05-23 | Paper |
| Long cycles in Hamiltonian graphs | 2019-02-07 | Paper |
| Diffusion on graphs is eventually periodic | 2019-01-28 | Paper |
| Balancing sums of random vectors | 2019-01-09 | Paper |
| Coalescence on the real line | 2019-01-09 | Paper |
| The number of hypergraphs without linear cycles | 2018-12-20 | Paper |
| Product-free sets in the free semigroup | 2018-12-11 | Paper |
| Line percolation | 2018-09-05 | Paper |
| The multiplication table problem for bipartite graphs | 2018-09-03 | Paper |
| On regular 3-wise intersecting families | 2018-08-02 | Paper |
| Connections in Randomly Oriented Graphs | 2018-07-24 | Paper |
| Induced Subgraphs With Many Distinct Degrees | 2018-01-19 | Paper |
| An improved lower bound for Folkman's theorem | 2017-09-13 | Paper |
| Catching a fast robber on the grid | 2017-09-05 | Paper |
| Reconstructing random jigsaws | 2017-07-15 | Paper |
| Approximations to m‐Colored Complete Infinite Hypergraphs | 2016-02-01 | Paper |
| On the stability of the Erdős-Ko-Rado theorem | 2015-11-06 | Paper |
| TRANSFERENCE FOR THE ERDŐS–KO–RADO THEOREM | 2015-11-02 | Paper |
| Disjoint induced subgraphs of the same order and size | 2015-06-18 | Paper |
| Separating path systems | 2014-12-22 | Paper |
| Exactly \(m\)-coloured complete infinite subgraphs | 2014-08-28 | Paper |
| A Canonical Ramsey Theorem for Exactly m-Coloured Complete Subgraphs | 2014-05-02 | Paper |
