| Publication | Date of Publication | Type |
|---|
On the $(k+2,k)$-problem of Brown, Erd\H{o}s and S\'os for $k=5,6,7$
(available as arXiv preprint) | N/A | Paper |
Tight Hamilton cycles with high discrepancy
Combinatorics, Probability and Computing | 2025-12-30 | Paper |
Steiner triple systems with high discrepancy
Journal of Combinatorial Designs | 2025-12-29 | Paper |
| Hamilton cycles in pseudorandom graphs (extended abstract) | 2025-04-15 | Paper |
Optimal Hamilton covers and linear arboricity for random graphs
Proceedings of the American Mathematical Society | 2025-02-11 | Paper |
Hamilton cycles in pseudorandom graphs
Advances in Mathematics | 2024-11-18 | Paper |
A rainbow blow-up lemma for almost optimally bounded edge-colourings
Acta Mathematica Universitatis Comenianae. New Series | 2024-10-18 | Paper |
Resolution of the Oberwolfach problem
Acta Mathematica Universitatis Comenianae. New Series | 2024-10-18 | Paper |
| The largest hole in sparse random graphs | 2024-09-13 | Paper |
| The intersection spectrum of 3-chromatic intersecting hypergraphs | 2024-09-13 | Paper |
On the \((6,4)\)-problem of Brown, Erdős, and Sós
Proceedings of the American Mathematical Society. Series B | 2024-06-27 | Paper |
| Conflict-free hypergraph matchings | 2024-05-14 | Paper |
| Tight Hamilton cycles with high discrepancy | 2023-12-15 | Paper |
The largest hole in sparse random graphs
Random Structures & Algorithms | 2023-10-17 | Paper |
The largest hole in sparse random graphs
Random Structures & Algorithms | 2023-10-17 | Paper |
| Optimal Hamilton covers and linear arboricity for random graphs | 2023-10-17 | Paper |
The intersection spectrum of 3‐chromatic intersecting hypergraphs
Proceedings of the London Mathematical Society | 2023-09-20 | Paper |
New results for MaxCut in H$H$‐free graphs
Journal of the London Mathematical Society | 2023-08-23 | Paper |
The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹
Memoirs of the American Mathematical Society | 2023-04-26 | Paper |
Short proofs for long induced paths
Combinatorics, Probability and Computing | 2023-03-31 | Paper |
Counting Hamilton cycles in Dirac hypergraphs
Combinatorics, Probability and Computing | 2023-03-30 | Paper |
| Hamilton cycles in pseudorandom graphs | 2023-03-09 | Paper |
Extremal aspects of graph and hypergraph decomposition problems
(available as arXiv preprint) | 2022-11-18 | Paper |
| Extremal aspects of graph and hypergraph decomposition problems | 2022-11-18 | Paper |
| On the $(6,4)$-problem of Brown, Erd\H{o}s and S\'os | 2022-09-28 | Paper |
The \(n\)-queens completion problem
Research in the Mathematical Sciences | 2022-07-22 | Paper |
| Conflict-free hypergraph matchings | 2022-05-11 | Paper |
An average degree condition for independent transversals
Journal of Combinatorial Theory. Series B | 2022-03-03 | Paper |
Resolution of the Oberwolfach problem
Journal of the European Mathematical Society (JEMS) | 2021-07-05 | Paper |
Pseudorandom hypergraph matchings
Combinatorics, Probability and Computing | 2021-06-15 | Paper |
Euler tours in hypergraphs
Combinatorica | 2021-03-20 | Paper |
| Note on induced paths in sparse random graphs | 2021-02-18 | Paper |
Decompositions into isomorphic rainbow spanning trees
Journal of Combinatorial Theory. Series B | 2021-02-03 | Paper |
On a conjecture of Erdős on locally sparse Steiner triple systems
Combinatorica | 2020-12-18 | Paper |
On a conjecture of Erdős on locally sparse Steiner triple systems
Combinatorica | 2020-12-18 | Paper |
A rainbow blow-up lemma for almost optimally bounded edge-colourings
Forum of Mathematics, Sigma | 2020-11-20 | Paper |
A rainbow blow-up lemma
Random Structures & Algorithms | 2020-10-26 | Paper |
Minimalist designs
Random Structures & Algorithms | 2020-09-16 | Paper |
| A note on dense bipartite induced subgraphs | 2020-06-09 | Paper |
On the decomposition threshold of a given graph
Journal of Combinatorial Theory. Series B | 2019-11-21 | Paper |
Triple systems with no three triples spanning at most five points
Bulletin of the London Mathematical Society | 2019-08-15 | Paper |
| Hypergraph $F$-designs for arbitrary $F$ | 2017-06-06 | Paper |
The existence of designs via iterative absorption: hypergraph F-designs for arbitrary F
(available as arXiv preprint) | 2016-11-21 | Paper |
Optimal path and cycle decompositions of dense quasirandom graphs
Electronic Notes in Discrete Mathematics | 2016-10-14 | Paper |
Optimal path and cycle decompositions of dense quasirandom graphs
Journal of Combinatorial Theory. Series B | 2016-03-14 | Paper |
On the<i>f</i>-matching polytope and the fractional<i>f</i>-chromatic index
International Journal of Computer Mathematics | 2015-04-27 | Paper |
