| Publication | Date of Publication | Type |
|---|
Fractional clique decompositions of dense hypergraphs
Bulletin of the London Mathematical Society | 2026-06-08 | Paper |
On generalized Ramsey numbers in the non-integral regime
The Electronic Journal of Combinatorics | 2026-04-29 | Paper |
Sunflowers in set systems with small VC-dimension
Combinatorica | 2026-01-20 | Paper |
Decomposing random regular graphs into stars
European Journal of Combinatorics | 2025-09-16 | Paper |
Almost all 9-regular graphs have a modulo-5 orientation
The Electronic Journal of Combinatorics | 2025-05-30 | Paper |
Reducing linear Hadwiger's conjecture to coloring small graphs
Journal of the American Mathematical Society | 2025-03-06 | Paper |
Asymptotically good local list edge colourings
Acta Mathematica Universitatis Comenianae. New Series | 2024-10-18 | Paper |
Edge-colouring graphs with local list sizes
Journal of Combinatorial Theory. Series B | 2024-01-15 | Paper |
| Decomposing random regular graphs into stars | 2023-08-30 | Paper |
| On generalized Ramsey numbers in the non-integral regime | 2022-12-20 | Paper |
| Almost all 9-regular graphs have a modulo-5 orientation | 2022-10-21 | Paper |
| The limit in the $(k+2, k)$-Problem of Brown, Erd\H{o}s and S\'os exists for all $k\geq 2$ | 2022-10-03 | Paper |
| Finding an almost perfect matching in a hypergraph avoiding forbidden submatchings | 2022-04-19 | Paper |
Independent sets in algebraic hypergraphs
Journal of the European Mathematical Society (JEMS) | 2022-03-29 | Paper |
Generalized rainbow Turán numbers of odd cycles
Discrete Mathematics | 2021-11-23 | Paper |
Progress towards Nash-Williams' conjecture on triangle decompositions
Journal of Combinatorial Theory. Series B | 2021-02-03 | Paper |
The Glauber dynamics for edge-colorings of trees
Random Structures & Algorithms | 2021-01-05 | Paper |
Improved bounds for randomly sampling colorings via linear programming
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
A short nonalgorithmic proof of the containers theorem for hypergraphs
Proceedings of the American Mathematical Society | 2019-02-12 | Paper |
Random 4-regular graphs have 3-star decompositions asymptotically almost surely
European Journal of Combinatorics | 2018-06-28 | Paper |
| Rapid mixing of Glauber dynamics for colorings below Vigoda's $11/6$ threshold | 2018-04-11 | Paper |
| On star decompositions of random regular graphs | 2018-01-18 | Paper |
| On the list coloring version of Reed's conjecture | 2018-01-18 | Paper |
| A combinatorial method for connecting BHV spaces representing different numbers of taxa | 2017-08-08 | Paper |
Rainbow copies of C₄ in edge-colored hypercubes
Discrete Applied Mathematics | 2016-06-22 | Paper |
On a conjecture of Thomassen
The Electronic Journal of Combinatorics | 2015-08-27 | Paper |
On a conjecture of Thomassen
The Electronic Journal of Combinatorics | 2015-08-27 | Paper |
Intersecting families of discrete structures are typically trivial
Journal of Combinatorial Theory. Series A | 2015-02-27 | Paper |
Taking the convoluted out of Bernoulli convolutions: a discrete approach
Integers | 2013-10-25 | Paper |
Locating a robber on a graph via distance queries
Theoretical Computer Science | 2013-01-07 | Paper |
Discrete Bernoulli convolutions: an algorithmic approach toward bound improvement
Proceedings of the American Mathematical Society | 2011-05-27 | Paper |
Reducing Linear Hadwiger's Conjecture to Coloring Small Graphs
(available as arXiv preprint) | N/A | Paper |
Refined Absorption: A New Proof of the Existence Conjecture
(available as arXiv preprint) | N/A | Paper |
Proof of the High Girth Existence Conjecture via Refined Absorption
(available as arXiv preprint) | N/A | Paper |
Clique Decompositions in Random Graphs via Refined Absorption
(available as arXiv preprint) | N/A | Paper |
Thresholds for (n,q,2)-Steiner Systems via Refined Absorption
(available as arXiv preprint) | N/A | Paper |
