| Publication | Date of Publication | Type |
|---|
Essential covers of the hypercube require many hyperplanes
Combinatorics, Probability and Computing | 2025-12-29 | Paper |
| The slice rank polynomial method -- a survey a few years later | 2025-09-30 | Paper |
A sharp Ramsey theorem for ordered hypergraph matchings
Advances in Combinatorics | 2025-09-19 | Paper |
Sharp bounds for rainbow matchings in hypergraphs
Journal of the London Mathematical Society. Second Series | 2025-09-01 | Paper |
| List-decodability with large radius for Reed-Solomon codes | 2025-08-13 | Paper |
Essentially tight bounds for rainbow cycles in proper edge-colourings
Proceedings of the London Mathematical Society. Third Series | 2025-04-25 | Paper |
Unit and distinct distances in typical norms
Geometric and Functional Analysis. GAFA | 2025-02-18 | Paper |
Rota's basis conjecture holds for random bases of vector spaces
European Journal of Combinatorics | 2024-09-30 | Paper |
| Resolution of the quadratic Littlewood--Offord problem | 2023-12-21 | Paper |
On the inducibility problem for random Cayley graphs of abelian groups with a few deleted vertices
Random Structures & Algorithms | 2023-10-12 | Paper |
| Essential covers of the hypercube require many hyperplanes | 2023-10-09 | Paper |
Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture
Forum of Mathematics, Pi | 2023-09-15 | Paper |
| A sharp Ramsey theorem for ordered hypergraph matchings | 2023-09-09 | Paper |
| Essentially tight bounds for rainbow cycles in proper edge-colourings | 2023-09-08 | Paper |
Polynomials that vanish to high order on most of the hypercube
Journal of the London Mathematical Society | 2023-08-22 | Paper |
Polynomials that vanish to high order on most of the hypercube
Journal of the London Mathematical Society | 2023-08-22 | Paper |
Finding solutions with distinct variables to systems of linear equations over \(\mathbb{F}_p\)
Mathematische Annalen | 2023-05-15 | Paper |
Singularity of sparse random matrices: simple proofs
Combinatorics, Probability and Computing | 2023-03-31 | Paper |
| On the Erd\H{o}s--Ginzburg--Ziv Problem in large dimension | 2023-02-28 | Paper |
| Unit and distinct distances in typical norms | 2023-02-17 | Paper |
| S\'ark\"ozy's Theorem in Various Finite Field Settings | 2022-12-24 | Paper |
| Sharp bounds for rainbow matchings in hypergraphs | 2022-12-14 | Paper |
List-Decodability With Large Radius for Reed-Solomon Codes
IEEE Transactions on Information Theory | 2022-07-13 | Paper |
Extension complexity of low-dimensional polytopes
Transactions of the American Mathematical Society | 2022-06-16 | Paper |
| Rota's basis conjecture holds for random bases of vector spaces | 2022-03-31 | Paper |
| On the probability of a Condorcet winner among a large number of alternatives | 2022-03-25 | Paper |
On the permanent of a random symmetric matrix
Selecta Mathematica. New Series | 2022-01-04 | Paper |
Combinatorial anti-concentration inequalities, with applications
Mathematical Proceedings of the Cambridge Philosophical Society | 2021-09-14 | Paper |
On the size of subsets of \(\mathbb{F}_p^n\) without \(p\) distinct elements summing to zero
Israel Journal of Mathematics | 2021-08-24 | Paper |
Anti-concentration for subgraph counts in random graphs
The Annals of Probability | 2021-07-02 | Paper |
On the speed of algebraically defined graph classes
Advances in Mathematics | 2021-02-15 | Paper |
Two graph theoretical problems
Mitteilungen der Deutschen Mathematiker-Vereinigung (DMV) | 2021-02-15 | Paper |
| Sharp estimates for spanning trees | 2021-02-02 | Paper |
A completion of the proof of the Edge-statistics Conjecture
Advances in Combinatorics | 2020-10-20 | Paper |
An algebraic inverse theorem for the quadratic Littlewood-Offord problem, and an application to Ramsey graphs
discrete Analysis | 2020-10-20 | Paper |
An upper bound on the size of avoidance couplings
Combinatorics, Probability and Computing | 2020-04-06 | Paper |
A lower bound for the \(k\)-multicolored sum-free problem in \(\mathbb{Z}_m^n\)
Proceedings of the London Mathematical Society | 2019-08-14 | Paper |
A proof of a conjecture of Erdős, Faudree, Rousseau and Schelp on subgraphs of minimum degree \(k\)
Journal of Combinatorial Theory. Series B | 2018-12-20 | Paper |
A polynomial bound for the arithmetic k-cycle removal lemma in vector spaces
Journal of Combinatorial Theory. Series A | 2018-09-07 | Paper |
Erdős-Ginzburg-Ziv constants by avoiding three-term arithmetic progressions
The Electronic Journal of Combinatorics | 2018-05-25 | Paper |
Erdős-Ginzburg-Ziv constants by avoiding three-term arithmetic progressions
The Electronic Journal of Combinatorics | 2018-05-25 | Paper |
On the \(\mu\)-admissible set in the extended affine Weyl groups of \(E_{6}\) and \(E_{7}\)
Journal of Algebra | 2016-02-04 | Paper |
Nash-Williams' theorem on decomposing graphs into forests
Mathematika | 2014-09-24 | Paper |
New lower bounds for three-term progression free sets in $\mathbb{F}_p^n$
(available as arXiv preprint) | N/A | Paper |
