| Publication | Date of Publication | Type |
|---|
An oriented discrepancy version of Dirac's theorem
Journal of Combinatorial Theory. Series B | 2024-10-08 | Paper |
Path decompositions of tournaments
| 2024-09-13 | Paper |
A lower bound on the multicolor size-Ramsey numbers of paths in hypergraphs
European Journal of Combinatorics | 2024-07-08 | Paper |
Cycle decompositions in \(k\)-uniform hypergraphs
Journal of Combinatorial Theory. Series B | 2024-05-10 | Paper |
Hamilton cycles in dense regular digraphs and oriented graphs
Journal of Combinatorial Theory. Series B | 2024-01-29 | Paper |
Ramsey goodness of $k$-uniform paths, or the lack thereof
| 2023-12-08 | Paper |
Path decompositions of tournaments
Proceedings of the London Mathematical Society | 2023-09-20 | Paper |
Cycle Partitions in Dense Regular Digraphs and Oriented Graphs
| 2023-09-20 | Paper |
Almost partitioning every $2$-edge-coloured complete $k$-graph into $k$ monochromatic tight cycles
| 2023-09-08 | Paper |
Upper density of monochromatic paths in edge-coloured infinite complete graphs and bipartite graphs
European Journal of Combinatorics | 2023-04-27 | Paper |
The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹
Memoirs of the American Mathematical Society | 2023-04-26 | Paper |
Complete subgraphs in a multipartite graph
Combinatorics, Probability and Computing | 2023-03-31 | Paper |
Towards Lehel's conjecture for 4-uniform tight cycles
The Electronic Journal of Combinatorics | 2023-01-17 | Paper |
An oriented discrepancy version of Dirac's theorem
| 2022-11-13 | Paper |
Upper density of monochromatic paths in edge-coloured infinite complete graphs and bipartite graphs
| 2022-01-21 | Paper |
The Ramsey number for 4-uniform tight cycles
| 2021-11-09 | Paper |
Monochromatic cycle partitions in random graphs
Combinatorics, Probability and Computing | 2021-06-15 | Paper |
Covering and tiling hypergraphs with tight cycles
Combinatorics, Probability and Computing | 2021-06-15 | Paper |
Transitive tournament tilings in oriented graphs with large minimum total degree
SIAM Journal on Discrete Mathematics | 2021-03-17 | Paper |
On a conjecture of Erdős on locally sparse Steiner triple systems
Combinatorica | 2020-12-18 | Paper |
Minimalist designs
Random Structures & Algorithms | 2020-09-16 | Paper |
Decomposing tournaments into paths
Proceedings of the London Mathematical Society | 2020-05-12 | Paper |
An asymptotic bound for the strong chromatic number
Combinatorics, Probability and Computing | 2020-04-06 | Paper |
On the decomposition threshold of a given graph
Journal of Combinatorial Theory. Series B | 2019-11-21 | Paper |
Spanning Trees with Few Branch Vertices
SIAM Journal on Discrete Mathematics | 2019-08-29 | Paper |
Long properly coloured cycles in edge-coloured graphs
Journal of Graph Theory | 2019-03-28 | Paper |
Density of monochromatic infinite paths
The Electronic Journal of Combinatorics | 2018-11-22 | Paper |
Transitive triangle tilings in oriented graphs
Journal of Combinatorial Theory. Series B | 2018-10-29 | Paper |
Hamilton cycles in sparse robustly expanding digraphs
The Electronic Journal of Combinatorics | 2018-09-07 | Paper |
Long properly coloured cycles in edge-coloured graphs
| 2018-08-13 | Paper |
Codegree Turán density of complete \(r\)-uniform hypergraphs
SIAM Journal on Discrete Mathematics | 2018-06-01 | Paper |
Subgraphs with large minimum \(\ell\)-degree in hypergraphs where almost all \(\ell\)-degrees are large
The Electronic Journal of Combinatorics | 2018-05-25 | Paper |
Covering and tiling hypergraphs with tight cycles
| 2018-01-18 | Paper |
Decomposing tournaments into paths
| 2018-01-18 | Paper |
Properly coloured Hamiltonian cycles in edge-coloured complete graphs
Combinatorica | 2017-11-10 | Paper |
Exact minimum codegree threshold for \(K^-_4\)-factors
Combinatorics, Probability and Computing | 2017-10-27 | Paper |
Fractional clique decompositions of dense graphs and hypergraphs
Journal of Combinatorial Theory. Series B | 2017-09-29 | Paper |
Proof of the 1-factorization and Hamilton Decomposition Conjectures
Memoirs of the American Mathematical Society | 2017-07-25 | Paper |
Clique decompositions of multipartite graphs and completion of Latin squares
Journal of Combinatorial Theory. Series A | 2017-07-13 | Paper |
Hypergraph $F$-designs for arbitrary $F$
| 2017-06-06 | Paper |
The existence of designs via iterative absorption: hypergraph $F$-designs for arbitrary $F$
| 2016-11-21 | Paper |
Edge-decompositions of graphs with high minimum degree
Electronic Notes in Discrete Mathematics | 2016-10-14 | Paper |
Solution to a problem of Bollobás and Häggkvist on Hamilton cycles in regular graphs
Journal of Combinatorial Theory. Series B | 2016-10-12 | Paper |
Edge-decompositions of graphs with high minimum degree
Advances in Mathematics | 2015-12-23 | Paper |
Existences of rainbow matchings and rainbow matching covers
Discrete Mathematics | 2015-06-29 | Paper |
\(F\)-factors in hypergraphs via absorption
Graphs and Combinatorics | 2015-05-22 | Paper |
The robust component structure of dense regular graphs and applications
Proceedings of the London Mathematical Society | 2015-01-26 | Paper |
On-line Ramsey numbers of paths and cycles
The Electronic Journal of Combinatorics | 2015-01-22 | Paper |
\({\ell}\)-degree Turán density
SIAM Journal on Discrete Mathematics | 2014-12-22 | Paper |
A note on large rainbow matchings in edge-coloured graphs
Graphs and Combinatorics | 2014-09-19 | Paper |
Perfect matchings in 3-partite 3-uniform hypergraphs
Journal of Combinatorial Theory. Series A | 2014-09-08 | Paper |
A note on the minimum size of \(k\)-rainbow-connected graphs
Discrete Mathematics | 2014-08-08 | Paper |
An Edge-Colored Version of Dirac's Theorem
SIAM Journal on Discrete Mathematics | 2014-06-19 | Paper |
Proof of the 1-factorization and Hamilton decomposition conjectures
| 2014-06-11 | Paper |
The robust component structure of dense regular graphs
| 2014-06-11 | Paper |
A Dirac type condition for properly coloured paths and cycles
Journal of Graph Theory | 2014-05-28 | Paper |
Proof of the 1-factorization and Hamilton decomposition conjectures II: the bipartite case
| 2014-01-16 | Paper |
Proof of the 1-factorization and Hamilton decomposition conjectures III: approximate decompositions
| 2014-01-16 | Paper |
Proof of the 1-factorization and Hamilton decomposition conjectures IV: exceptional systems for the two cliques case
| 2014-01-16 | Paper |
Cliques in graphs with bounded minimum degree
Electronic Notes in Discrete Mathematics | 2013-10-10 | Paper |
Minimum codegree threshold for \((K^3_4-e)\)-factors
Journal of Combinatorial Theory. Series A | 2013-03-06 | Paper |
A Multipartite Version of the Hajnal–Szemerédi Theorem for Graphs and Hypergraphs
Combinatorics, Probability and Computing | 2013-01-21 | Paper |
Rainbow matchings of size \(\delta(G)\) in properly edge-colored graphs
The Electronic Journal of Combinatorics | 2012-10-24 | Paper |
Cliques in graphs with bounded minimum degree
Combinatorics, Probability and Computing | 2012-06-04 | Paper |
A note on rainbow matchings in properly edge-coloured graphs
| 2011-08-26 | Paper |
Constrained Ramsey numbers for rainbow matching
Journal of Graph Theory | 2011-06-07 | Paper |
Triangles in regular graphs with density below one half
Combinatorics, Probability and Computing | 2010-04-23 | Paper |
A lower bound on the multicolor size-Ramsey numbers of paths in hypergraphs
| N/A | Paper |
