| Publication | Date of Publication | Type |
|---|
Perfect matchings in random sparsifications of Dirac hypergraphs
Combinatorica | 2025-01-14 | Paper |
Solution to a problem of Erdős on the chromatic index of hypergraphs with bounded codegree
Proceedings of the London Mathematical Society. Third Series | 2025-01-09 | Paper |
A special case of Vu's conjecture: colouring nearly disjoint graphs of bounded maximum degree
Combinatorics, Probability and Computing | 2024-11-05 | Paper |
Fractional coloring with local demands and applications to degree-sequence bounds on the independence number
Journal of Combinatorial Theory. Series B | 2024-10-08 | Paper |
Optimal spread for spanning subgraphs of Dirac hypergraphs
Journal of Combinatorial Theory. Series B | 2024-10-08 | Paper |
Improving the Caro-Wei bound and applications to Turán stability
Discrete Applied Mathematics | 2024-09-26 | Paper |
Graph and hypergraph colouring via nibble methods: a survey
European Congress of Mathematics | 2023-11-10 | Paper |
| Subsquares in random Latin squares and rectangles | 2023-11-07 | Paper |
Hamilton transversals in random Latin squares
Random Structures & Algorithms | 2023-10-19 | Paper |
Colorings, transversals, and local sparsity
Random Structures & Algorithms | 2023-10-12 | Paper |
Colorings, transversals, and local sparsity
Random Structures & Algorithms | 2023-10-12 | Paper |
On the density of critical graphs with no large cliques
Combinatorica | 2023-10-04 | Paper |
A proof of the Erdős-Faber-Lovász conjecture
Annals of Mathematics. Second Series | 2023-09-06 | Paper |
Thresholds for Latin squares and Steiner triple systems: Bounds within a logarithmic factor
(available as arXiv preprint) | 2023-08-28 | Paper |
| Optimal spread for spanning subgraphs of Dirac hypergraphs | 2023-08-16 | Paper |
| The independence ratio of 4-cycle-free planar graphs | 2023-05-03 | Paper |
Almost all optimally coloured complete graphs contain a rainbow Hamilton path
Journal of Combinatorial Theory. Series B | 2022-06-10 | Paper |
| Solution to a problem of Erd\H{o}s on the chromatic index of hypergraphs with bounded codegree | 2021-10-12 | Paper |
| A special case of Vu's conjecture: Coloring nearly disjoint graphs of bounded maximum degree | 2021-09-23 | Paper |
Corrigendum to: ``A local epsilon version of Reed's conjecture
Journal of Combinatorial Theory. Series B | 2021-09-16 | Paper |
| Fractional vertex-arboricity of planar graphs | 2020-09-25 | Paper |
A local epsilon version of Reed's conjecture
Journal of Combinatorial Theory. Series B | 2020-01-15 | Paper |
Size of the largest induced forest in subcubic graphs of girth at least four and five
Journal of Graph Theory | 2019-01-03 | Paper |
| Fractional coloring with local demands | 2018-11-28 | Paper |
Induced 2-degenerate subgraphs of triangle-free planar graphs
The Electronic Journal of Combinatorics | 2018-05-25 | Paper |
Induced 2-degenerate subgraphs of triangle-free planar graphs
The Electronic Journal of Combinatorics | 2018-05-25 | Paper |
Exponentially many 4-list-colorings of triangle-free graphs on surfaces
Journal of Graph Theory | 2018-02-23 | Paper |
A local epsilon version of Reed's conjecture
Electronic Notes in Discrete Mathematics | 2018-01-18 | Paper |
Minimum size of feedback vertex sets of planar graphs of girth at least five
European Journal of Combinatorics | 2016-12-27 | Paper |
Perfect matchings in random sparsifications of Dirac hypergraphs
(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 |
