Publication | Date of Publication | Type |
---|
Hamilton cycles in dense regular digraphs and oriented graphs | 2024-01-29 | Paper |
Ramsey goodness of $k$-uniform paths, or the lack thereof | 2023-12-08 | Paper |
Path decompositions of tournaments | 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 | 2023-04-27 | Paper |
The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹 | 2023-04-26 | Paper |
Complete subgraphs in a multipartite graph | 2023-03-31 | Paper |
Towards Lehel's conjecture for 4-uniform tight cycles | 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 | 2021-06-15 | Paper |
Covering and tiling hypergraphs with tight cycles | 2021-06-15 | Paper |
Transitive Tournament Tilings in Oriented Graphs with Large Minimum Total Degree | 2021-03-17 | Paper |
On a conjecture of Erdős on locally sparse Steiner triple systems | 2020-12-18 | Paper |
Minimalist designs | 2020-09-16 | Paper |
Decomposing tournaments into paths | 2020-05-12 | Paper |
An asymptotic bound for the strong chromatic number | 2020-04-06 | Paper |
On the decomposition threshold of a given graph | 2019-11-21 | Paper |
Spanning Trees with Few Branch Vertices | 2019-08-29 | Paper |
Long properly coloured cycles in edge‐coloured graphs | 2019-03-28 | Paper |
Density of monochromatic infinite paths | 2018-11-22 | Paper |
Transitive triangle tilings in oriented graphs | 2018-10-29 | Paper |
Hamilton cycles in sparse robustly expanding digraphs | 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 | 2018-06-01 | Paper |
Subgraphs with large minimum \(\ell\)-degree in hypergraphs where almost all \(\ell\)-degrees are large | 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 | 2017-11-10 | Paper |
Exact Minimum Codegree Threshold for K−4-Factors | 2017-10-27 | Paper |
Fractional clique decompositions of dense graphs and hypergraphs | 2017-09-29 | Paper |
Proof of the 1-factorization and Hamilton Decomposition Conjectures | 2017-07-25 | Paper |
Clique decompositions of multipartite graphs and completion of Latin squares | 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 | 2016-10-14 | Paper |
Solution to a problem of Bollobás and Häggkvist on Hamilton cycles in regular graphs | 2016-10-12 | Paper |
Edge-decompositions of graphs with high minimum degree | 2015-12-23 | Paper |
Existences of rainbow matchings and rainbow matching covers | 2015-06-29 | Paper |
\(F\)-factors in hypergraphs via absorption | 2015-05-22 | Paper |
The robust component structure of dense regular graphs and applications | 2015-01-26 | Paper |
On-line Ramsey numbers of paths and cycles | 2015-01-22 | Paper |
${\ell}$-Degree Turán Density | 2014-12-22 | Paper |
A note on large rainbow matchings in edge-coloured graphs | 2014-09-19 | Paper |
Perfect matchings in 3-partite 3-uniform hypergraphs | 2014-09-08 | Paper |
A note on the minimum size of \(k\)-rainbow-connected graphs | 2014-08-08 | Paper |
An Edge-Colored Version of Dirac's Theorem | 2014-06-19 | Paper |
https://portal.mardi4nfdi.de/entity/Q5419947 | 2014-06-11 | Paper |
Proof of the $1$-factorization and Hamilton Decomposition Conjectures | 2014-06-11 | Paper |
A Dirac Type Condition for Properly Coloured Paths and Cycles | 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 | 2013-10-10 | Paper |
Minimum codegree threshold for \((K^3_4-e)\)-factors | 2013-03-06 | Paper |
A Multipartite Version of the Hajnal–Szemerédi Theorem for Graphs and Hypergraphs | 2013-01-21 | Paper |
Rainbow matchings of size \(\delta(G)\) in properly edge-colored graphs | 2012-10-24 | Paper |
Cliques in Graphs With Bounded Minimum Degree | 2012-06-04 | Paper |
A note on rainbow matchings in properly edge-coloured graphs | 2011-08-26 | Paper |
Constrained Ramsey numbers for rainbow matching | 2011-06-07 | Paper |
Triangles in Regular Graphs with Density Below One Half | 2010-04-23 | Paper |