| 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 |
Resolution of the Oberwolfach problem
Acta Mathematica Universitatis Comenianae. New Series | 2024-10-18 | Paper |
Resilience with respect to Hamiltonicity in random graphs
Acta Mathematica Universitatis Comenianae. New Series | 2024-10-18 | Paper |
| Path decompositions of tournaments | 2024-09-13 | Paper |
scientific article; zbMATH DE number 7788394 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
New bounds on the size of nearly perfect matchings in almost regular hypergraphs
Journal of the London Mathematical Society | 2023-12-19 | Paper |
Graph and hypergraph colouring via nibble methods: a survey
European Congress of Mathematics | 2023-11-10 | Paper |
Hypergraph regularity and random sampling
Random Structures & Algorithms | 2023-10-23 | Paper |
Path decompositions of tournaments
Proceedings of the London Mathematical Society | 2023-09-20 | 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 |
The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹
Memoirs of the American Mathematical Society | 2023-04-26 | Paper |
Counting Hamilton cycles in Dirac hypergraphs
Combinatorics, Probability and Computing | 2023-03-30 | 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 |
The minimum degree threshold for perfect graph packings
Combinatorica | 2022-06-29 | Paper |
Almost all optimally coloured complete graphs contain a rainbow Hamilton path
Journal of Combinatorial Theory. Series B | 2022-06-10 | Paper |
Path and cycle decompositions of dense graphs
Journal of the London Mathematical Society | 2021-12-16 | Paper |
Path and cycle decompositions of dense graphs
Journal of the London Mathematical Society | 2021-12-16 | 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 |
Resolution of the Oberwolfach problem
Journal of the European Mathematical Society (JEMS) | 2021-07-05 | Paper |
Dirac's theorem for random regular graphs
Combinatorics, Probability and Computing | 2021-06-15 | Paper |
Euler tours in hypergraphs
Combinatorica | 2021-03-20 | 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 |
Rainbow structures in locally bounded colorings of graphs
Random Structures & Algorithms | 2020-10-26 | Paper |
Minimalist designs
Random Structures & Algorithms | 2020-09-16 | Paper |
Resilient degree sequences with respect to Hamilton cycles and matchings in random graphs
(available as arXiv preprint) | 2020-01-17 | Paper |
| Resilient degree sequences with respect to Hamilton cycles and matchings in random graphs | 2020-01-17 | Paper |
Optimal packings of bounded degree trees
Journal of the European Mathematical Society (JEMS) | 2019-12-12 | Paper |
On the decomposition threshold of a given graph
Journal of Combinatorial Theory. Series B | 2019-11-21 | Paper |
Edge correlations in Random regular hypergraphs and applications to subgraph testing
SIAM Journal on Discrete Mathematics | 2019-10-25 | Paper |
A bandwidth theorem for approximate decompositions
Proceedings of the London Mathematical Society | 2019-07-10 | Paper |
A bandwidth theorem for approximate decompositions
Proceedings of the London Mathematical Society | 2019-07-10 | Paper |
A blow-up lemma for approximate decompositions
Transactions of the American Mathematical Society | 2019-05-03 | Paper |
Forbidding induced even cycles in a graph: typical structure and counting
Journal of Combinatorial Theory. Series B | 2018-05-09 | Paper |
Proof of a tournament partition conjecture and an application to 1-factors with prescribed cycle lengths
Combinatorica | 2017-11-10 | Paper |
Proof of a tournament partition conjecture and an application to 1-factors with prescribed cycle lengths
Combinatorica | 2017-11-10 | Paper |
Hamilton cycles in graphs and hypergraphs: an extremal perspective
(available as arXiv preprint) | 2017-11-06 | 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 |
| A characterization of testable hypergraph properties | 2017-07-11 | 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 |
Bipartitions of highly connected tournaments
Electronic Notes in Discrete Mathematics | 2016-10-14 | Paper |
Optimal path and cycle decompositions of dense quasirandom graphs
Electronic Notes in Discrete Mathematics | 2016-10-14 | Paper |
On the random greedy \(F\)-free hypergraph process
(available as arXiv preprint) | 2016-10-14 | 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 |
On the random greedy \(F\)-free hypergraph process
SIAM Journal on Discrete Mathematics | 2016-07-13 | Paper |
A domination algorithm for \(\{0,1\}\)-instances of the travelling salesman problem
Random Structures & Algorithms | 2016-06-10 | Paper |
Bipartitions of highly connected tournaments
SIAM Journal on Discrete Mathematics | 2016-05-17 | Paper |
Optimal path and cycle decompositions of dense quasirandom graphs
Journal of Combinatorial Theory. Series B | 2016-03-14 | Paper |
Edge-decompositions of graphs with high minimum degree
Advances in Mathematics | 2015-12-23 | Paper |
Arbitrary orientations of Hamilton cycles in digraphs
SIAM Journal on Discrete Mathematics | 2015-09-02 | Paper |
Edge-disjoint Hamilton cycles in random graphs
Random Structures & Algorithms | 2015-05-29 | Paper |
The robust component structure of dense regular graphs and applications
Proceedings of the London Mathematical Society | 2015-01-26 | Paper |
The robust component structure of dense regular graphs and applications
Proceedings of the London Mathematical Society | 2015-01-26 | Paper |
Optimal covers with Hamilton cycles in random graphs
Combinatorica | 2015-01-07 | Paper |
Proof of a conjecture of Thomassen on Hamilton cycles in highly connected tournaments
Proceedings of the London Mathematical Society. Third Series | 2014-10-15 | Paper |
| The robust component structure of dense regular graphs | 2014-06-11 | Paper |
Fractional and integer matchings in uniform hypergraphs
The Seventh European Conference on Combinatorics, Graph Theory and Applications | 2014-06-11 | Paper |
| Proof of a conjecture of Thomassen on Hamilton cycles in highly connected tournaments | 2014-06-11 | Paper |
Proof of the 1-factorization and Hamilton decomposition conjectures
(available as arXiv preprint) | 2014-06-11 | Paper |
Decompositions of complete uniform hypergraphs into Hamilton Berge cycles
Journal of Combinatorial Theory. Series A | 2014-06-03 | Paper |
Fractional and integer matchings in uniform hypergraphs
European Journal of Combinatorics | 2014-02-10 | Paper |
Hamilton decompositions of regular expanders: applications
Journal of Combinatorial Theory. Series B | 2014-02-06 | 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 |
| Matchings in 3-uniform hypergraphs of large minimum vertex degree | 2013-11-01 | Paper |
| A proof of Sumner's universal tournament conjecture for large tournaments | 2013-11-01 | Paper |
Short cycles in oriented graphs
Electronic Notes in Discrete Mathematics | 2013-10-10 | Paper |
Degree sequences forcing Hamilton cycles in directed graphs
Electronic Notes in Discrete Mathematics | 2013-10-10 | Paper |
Optimal packings of Hamilton cycles in graphs of high minimum degree
Combinatorics, Probability and Computing | 2013-05-13 | Paper |
Matchings in 3-uniform hypergraphs
Journal of Combinatorial Theory. Series B | 2013-04-17 | Paper |
Hamilton decompositions of regular expanders: A proof of Kelly's conjecture for large tournaments
Advances in Mathematics | 2013-04-16 | Paper |
On Pósa's conjecture for random graphs
SIAM Journal on Discrete Mathematics | 2013-01-04 | Paper |
Finding Hamilton cycles in robustly expanding digraphs
Journal of Graph Algorithms and Applications | 2012-12-04 | Paper |
Embedding cycles of given length in oriented graphs
European Journal of Combinatorics | 2012-12-03 | Paper |
Edge-disjoint Hamilton cycles in graphs
Journal of Combinatorial Theory. Series B | 2012-10-19 | Paper |
A survey on Hamilton cycles in directed graphs
European Journal of Combinatorics | 2012-05-04 | Paper |
Approximate Hamilton decompositions of random graphs
Random Structures & Algorithms | 2012-03-07 | Paper |
An approximate version of Sumner's universal tournament conjecture
Journal of Combinatorial Theory. Series B | 2011-12-08 | Paper |
A semiexact degree condition for Hamilton cycles in digraphs
SIAM Journal on Discrete Mathematics | 2011-06-17 | Paper |
A proof of Sumner's universal tournament conjecture for large tournaments
Proceedings of the London Mathematical Society | 2011-04-28 | Paper |
Loose Hamilton cycles in hypergraphs
Discrete Mathematics | 2011-03-08 | Paper |
Minors in random regular graphs
Random Structures & Algorithms | 2010-11-09 | Paper |
An Ore-type theorem for perfect packings in graphs
SIAM Journal on Discrete Mathematics | 2010-08-27 | Paper |
Critical chromatic number and the complexity of perfect packings in graphs
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
Embedding and Ramsey numbers of sparse \(k\)-uniform hypergraphs
Combinatorica | 2010-08-13 | Paper |
Hamilton \(\ell \)-cycles in uniform hypergraphs
Journal of Combinatorial Theory. Series A | 2010-08-11 | Paper |
| \(K_\ell^-\)-factors in graphs | 2010-07-30 | Paper |
| scientific article; zbMATH DE number 5763200 (Why is no real title available?) | 2010-07-30 | Paper |
Hamilton decompositions of regular tournaments
Proceedings of the London Mathematical Society | 2010-07-22 | Paper |
Hamiltonian degree sequences in digraphs
Journal of Combinatorial Theory. Series B | 2010-06-03 | Paper |
Cycles of given length in oriented graphs
Journal of Combinatorial Theory. Series B | 2010-04-21 | Paper |
Embedding large subgraphs into dense graphs
(available as arXiv preprint) | 2010-01-13 | Paper |
An exact minimum degree condition for Hamilton cycles in oriented graphs
Journal of the London Mathematical Society | 2009-02-06 | Paper |
Linkedness and Ordered Cycles in Digraphs
Combinatorics, Probability and Computing | 2008-12-11 | Paper |
A Dirac-Type Result on Hamilton Cycles in Oriented Graphs
Combinatorics, Probability and Computing | 2008-10-13 | Paper |
The order of the largest complete minor in a random graph
Random Structures & Algorithms | 2008-09-04 | Paper |
The order of the largest complete minor in a random graph
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
A minimum degree condition forcing a digraph to be k-linked
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
Ramsey numbers of sparse hypergraphs
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
3-uniform hypergraphs of bounded degree have linear Ramsey numbers
Journal of Combinatorial Theory. Series B | 2008-04-28 | Paper |
Perfect packings with complete graphs minus an edge
European Journal of Combinatorics | 2007-11-21 | Paper |
Maximizing Several Cuts Simultaneously
Combinatorics, Probability and Computing | 2007-07-30 | Paper |
Multicolored Hamilton Cycles and Perfect Matchings in Pseudorandom Graphs
SIAM Journal on Discrete Mathematics | 2007-05-22 | Paper |
Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree
Journal of Combinatorial Theory. Series B | 2007-01-16 | Paper |
Improved Bounds for Topological Cliques in Graphs of Large Girth
SIAM Journal on Discrete Mathematics | 2006-06-01 | Paper |
Matchings in hypergraphs of large minimum degree
Journal of Graph Theory | 2006-05-16 | Paper |
The minimum degree threshold for perfect graph packings
(available as arXiv preprint) | 2006-03-28 | Paper |
Extremal connectivity for topological cliques in bipartite graphs
Journal of Combinatorial Theory. Series B | 2006-01-10 | Paper |
Large planar subgraphs in dense graphs
Journal of Combinatorial Theory. Series B | 2005-11-22 | Paper |
Spanning triangulations in graphs
Journal of Graph Theory | 2005-08-01 | Paper |
On infinite cycles. I, II
Combinatorica | 2005-07-05 | Paper |
Complete minors in \(K_{s,s}\)-free graphs
Combinatorica | 2005-07-05 | Paper |
Packings in Dense Regular Graphs
Combinatorics, Probability and Computing | 2005-06-07 | Paper |
Four-cycles in graphs without a given even cycle
Journal of Graph Theory | 2005-04-21 | Paper |
Graph minor hierarchies
Discrete Applied Mathematics | 2005-02-22 | Paper |
Induced subdivisions in \(K_{s,s}\)-free graphs of large average degree
Combinatorica | 2005-02-14 | Paper |
Forcing unbalanced complete bipartite minors
European Journal of Combinatorics | 2005-01-11 | Paper |
Every graph of sufficiently large average degree contains a \(C_4\)-free subgraph of large average degree
Combinatorica | 2004-10-19 | Paper |
Topological paths, cycles and spanning trees in infinite graphs
European Journal of Combinatorics | 2004-10-04 | Paper |
Subdivisions of $K_{r+2}$ in Graphs of Average Degree at Least $r+\varepsilon$ and Large but Constant Girth
Combinatorics, Probability and Computing | 2004-09-24 | Paper |
Large Topological Cliques in Graphs Without a 4-Cycle
Combinatorics, Probability and Computing | 2004-09-07 | Paper |
Partitions of graphs with high minimum degree or connectivity.
Journal of Combinatorial Theory. Series B | 2003-08-25 | Paper |
Graph-theoretical versus topological ends of graphs.
Journal of Combinatorial Theory. Series B | 2003-08-20 | Paper |
Topological minors in graphs of large girth
Journal of Combinatorial Theory. Series B | 2003-08-20 | Paper |
| scientific article; zbMATH DE number 1941338 (Why is no real title available?) | 2003-06-29 | Paper |
Minors in graphs of large girth
Random Structures & Algorithms | 2003-04-03 | Paper |
Forcing a Kr minor by high external connectivity
Journal of Graph Theory | 2002-07-01 | Paper |
On well-quasi-ordering infinite trees---Nash-Williams's theorem revisited
Mathematical Proceedings of the Cambridge Philosophical Society | 2001-12-02 | Paper |
| Minor-universal planar graphs without accumulation points | 2001-04-04 | Paper |
| A universal planar graph under the minor relation | 2000-02-27 | Paper |
Perfect matchings in random sparsifications of Dirac hypergraphs
(available as arXiv preprint) | N/A | Paper |
