| Publication | Date of Publication | Type |
|---|
| Resolution of the quadratic Littlewood--Offord problem | 2023-12-21 | Paper |
| The inertia bound is far from tight | 2023-12-08 | Paper |
| Friendly bisections of random graphs | 2023-10-17 | Paper |
| Substructures in Latin squares | 2023-10-12 | Paper |
| Exponentially many graphs are determined by their spectrum | 2023-09-18 | Paper |
| Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture | 2023-09-15 | Paper |
| Extremal, enumerative and probabilistic results on ordered hypergraph matchings | 2023-08-23 | Paper |
| Large deviations in random latin squares | 2023-08-18 | Paper |
| Partitioning problems via random processes | 2023-07-12 | Paper |
| Singularity of the \(k\)-core of a random graph | 2023-05-11 | Paper |
| Singularity of sparse random matrices: simple proofs | 2023-03-31 | Paper |
| Books, Hallways and Social Butterflies: A Note on Sliding Block Puzzles | 2023-03-16 | Paper |
| The Exact Rank of Sparse Random Graphs | 2023-03-09 | Paper |
| Enumerating matroids and linear spaces | 2023-02-03 | Paper |
| Geometric and o-minimal Littlewood-Offord problems | 2022-12-08 | Paper |
| List-Decodability With Large Radius for Reed-Solomon Codes | 2022-07-13 | Paper |
| Extension complexity of low-dimensional polytopes | 2022-06-16 | Paper |
| Dirac-type theorems in random hypergraphs | 2022-04-27 | Paper |
| High-Girth Steiner Triple Systems | 2022-01-12 | Paper |
| On the permanent of a random symmetric matrix | 2022-01-04 | Paper |
| Enumerating Matroids and Linear Spaces | 2021-12-07 | Paper |
| Note on random Latin squares and the triangle removal process | 2021-09-30 | Paper |
| Combinatorial anti-concentration inequalities, with applications | 2021-09-14 | Paper |
| Anti-concentration for subgraph counts in random graphs | 2021-07-02 | Paper |
| Acyclic subgraphs of tournaments with high chromatic number | 2021-07-02 | Paper |
| Lower bounds for superpatterns and universal sequences | 2021-06-30 | Paper |
| Geometric and o-minimal Littlewood-Offord problems | 2021-06-09 | Paper |
| Almost all Steiner triple systems have perfect matchings | 2021-05-10 | Paper |
| Halfway to Rota’s Basis Conjecture | 2021-03-11 | Paper |
| Almost all Steiner triple systems are almost resolvable | 2020-11-20 | Paper |
| An algebraic inverse theorem for the quadratic Littlewood-Offord problem, and an application to Ramsey graphs | 2020-10-20 | Paper |
| Universality of random permutations | 2020-07-27 | Paper |
| Ramsey Graphs Induce Subgraphs of Quadratically Many Sizes | 2020-05-04 | Paper |
| Proof of a conjecture on induced subgraphs of Ramsey graphs | 2019-10-24 | Paper |
| Hypergraph cuts above the average | 2019-10-08 | Paper |
| Counting Hamilton cycles in sparse random directed graphs | 2019-02-20 | Paper |
| The random k‐matching‐free process | 2019-02-20 | Paper |
| On Kahn's basis conjecture | 2018-10-17 | Paper |
| Intercalates and discrepancy in random Latin squares | 2018-06-07 | Paper |
| The design of the ICE encryption algorithm | 2018-05-09 | Paper |
| Resilience for the Littlewood-Offord problem | 2018-01-18 | Paper |
| Cycles and Matchings in Randomly Perturbed Digraphs and Hypergraphs | 2017-10-10 | Paper |
| Resilience for the Littlewood-Offord problem | 2017-09-19 | Paper |
| The average number of spanning trees in sparse graphs with given degrees | 2017-06-19 | Paper |
| Bounded-Degree Spanning Trees in Randomly Perturbed Graphs | 2017-01-27 | Paper |
| Cycles and matchings in randomly perturbed digraphs and hypergraphs | 2016-10-14 | Paper |
| On the number of spanning trees in random regular graphs | 2014-09-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4314057 | 1995-11-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4314015 | 1995-01-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4314031 | 1995-01-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5561627 | 1964-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5519709 | 1962-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5518978 | 1960-01-01 | Paper |
| A central limit theorem for the matching number of a sparse random graph | 0001-01-03 | Paper |
