| Publication | Date of Publication | Type |
|---|
On oriented cycles in randomly perturbed digraphs
Combinatorics, Probability and Computing | 2024-11-05 | Paper |
A note on color-bias perfect matchings in hypergraphs
SIAM Journal on Discrete Mathematics | 2024-10-22 | Paper |
Tiling edge-ordered graphs with monotone paths and other structures
SIAM Journal on Discrete Mathematics | 2024-06-25 | Paper |
The induced saturation problem for posets
Combinatorial Theory | 2024-04-02 | Paper |
On some extremal and probabilistic questions for tree posets
The Electronic Journal of Combinatorics | 2024-02-19 | Paper |
An asymmetric random Rado theorem for single equations: The 0‐statement
Random Structures & Algorithms | 2023-10-12 | Paper |
Tilings in randomly perturbed graphs: Bridging the gap between Hajnal‐Szemerédi and Johansson‐Kahn‐Vu
Random Structures & Algorithms | 2023-10-11 | Paper |
| Tiling edge-ordered graphs with monotone paths and other structures | 2023-05-12 | Paper |
On deficiency problems for graphs
Combinatorics, Probability and Computing | 2023-03-31 | Paper |
Complete subgraphs in a multipartite graph
Combinatorics, Probability and Computing | 2023-03-31 | Paper |
| On oriented cycles in randomly perturbed digraphs | 2022-12-20 | Paper |
Dirac-type results for tilings and coverings in ordered graphs
Forum of Mathematics, Sigma | 2022-12-08 | Paper |
On maximal sum-free sets in abelian groups
The Electronic Journal of Combinatorics | 2022-06-13 | Paper |
Tilings in vertex ordered graphs
Journal of Combinatorial Theory. Series B | 2022-04-27 | Paper |
Extremal problems for multigraphs
Journal of Combinatorial Theory. Series B | 2022-03-03 | Paper |
Ramsey properties of randomly perturbed graphs: cliques and cycles
Combinatorics, Probability and Computing | 2021-06-15 | Paper |
A discrepancy version of the Hajnal-Szemerédi theorem
Combinatorics, Probability and Computing | 2021-06-15 | Paper |
A note on color-bias Hamilton cycles in dense graphs
SIAM Journal on Discrete Mathematics | 2021-05-28 | Paper |
Transitive tournament tilings in oriented graphs with large minimum total degree
SIAM Journal on Discrete Mathematics | 2021-03-17 | Paper |
Vertex Ramsey properties of randomly perturbed graphs
Random Structures & Algorithms | 2021-01-05 | Paper |
Existence thresholds and Ramsey properties of random posets
Random Structures & Algorithms | 2021-01-05 | Paper |
The bandwidth theorem for locally dense graphs
Forum of Mathematics, Sigma | 2020-11-20 | Paper |
A degree sequence version of the Kühn-Osthus tiling theorem
The Electronic Journal of Combinatorics | 2020-09-08 | Paper |
Tilings in randomly perturbed dense graphs
Combinatorics, Probability and Computing | 2020-03-11 | Paper |
The complexity of perfect matchings and packings in dense hypergraphs
Journal of Combinatorial Theory. Series B | 2020-01-15 | Paper |
A degree sequence Komlós theorem
SIAM Journal on Discrete Mathematics | 2019-10-28 | Paper |
Tiling directed graphs with tournaments
Forum of Mathematics, Sigma | 2019-03-12 | Paper |
Independent sets in hypergraphs and Ramsey properties of graphs and the integers
SIAM Journal on Discrete Mathematics | 2019-01-16 | Paper |
Sharp bound on the number of maximal sum-free subsets of integers
Journal of the European Mathematical Society (JEMS) | 2018-08-24 | Paper |
On the complexity of finding and counting solution-free sets of integers
Discrete Applied Mathematics | 2018-05-24 | Paper |
Exact minimum codegree threshold for \(K^-_4\)-factors
Combinatorics, Probability and Computing | 2017-10-27 | Paper |
On solution-free sets of integers. II
Acta Arithmetica | 2017-10-10 | Paper |
On directed versions of the Hajnal-Szemerédi theorem
Combinatorics, Probability and Computing | 2017-10-04 | Paper |
An improved lower bound for Folkman's theorem
Bulletin of the London Mathematical Society | 2017-09-13 | Paper |
On solution-free sets of integers
European Journal of Combinatorics | 2017-09-11 | Paper |
Proof of the 1-factorization and Hamilton Decomposition Conjectures
Memoirs of the American Mathematical Society | 2017-07-25 | Paper |
On degree sequences forcing the square of a Hamilton cycle
SIAM Journal on Discrete Mathematics | 2017-03-16 | Paper |
| Enumerating solution-free sets in the integers | 2017-02-09 | Paper |
Applications of graph containers in the Boolean lattice
Random Structures & Algorithms | 2017-01-05 | Paper |
Applications of graph containers in the Boolean lattice
Random Structures & Algorithms | 2017-01-05 | Paper |
| On a degree sequence analogue of Pósa's conjecture | 2016-10-14 | Paper |
| A sharp bound on the number of maximal sum-free sets | 2016-10-14 | Paper |
A degree sequence Hajnal-Szemerédi theorem
Journal of Combinatorial Theory. Series B | 2016-03-14 | Paper |
A note on perfect matchings in uniform hypergraphs
The Electronic Journal of Combinatorics | 2016-01-25 | Paper |
A note on perfect matchings in uniform hypergraphs
The Electronic Journal of Combinatorics | 2016-01-25 | Paper |
The number of maximal sum-free subsets of integers
Proceedings of the American Mathematical Society | 2015-09-08 | Paper |
Exact minimum degree thresholds for perfect matchings in uniform hypergraphs. II
Journal of Combinatorial Theory. Series A | 2015-06-19 | Paper |
Monochromatic triangles in three-coloured graphs
Journal of Combinatorial Theory. Series B | 2014-10-16 | Paper |
A random version of Sperner's theorem
Journal of Combinatorial Theory. Series A | 2014-10-07 | Paper |
Proof of the 1-factorization and Hamilton decomposition conjectures
(available as arXiv preprint) | 2014-06-11 | Paper |
Tight minimum degree conditions forcing perfect matchings in uniform hypergraphs
The Seventh European Conference on Combinatorics, Graph Theory and Applications | 2014-06-11 | 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 |
| Matchings in 3-uniform hypergraphs of large minimum vertex degree | 2013-11-01 | Paper |
Degree sequences forcing Hamilton cycles in directed graphs
Electronic Notes in Discrete Mathematics | 2013-10-10 | Paper |
On perfect packings in dense graphs
The Electronic Journal of Combinatorics | 2013-06-07 | Paper |
On perfect packings in dense graphs
The Electronic Journal of Combinatorics | 2013-06-07 | Paper |
Matchings in 3-uniform hypergraphs
Journal of Combinatorial Theory. Series B | 2013-04-17 | Paper |
Embedding spanning bipartite graphs of small bandwidth
Combinatorics, Probability and Computing | 2013-01-21 | Paper |
Exact minimum degree thresholds for perfect matchings in uniform hypergraphs
Journal of Combinatorial Theory. Series A | 2012-08-01 | Paper |
A note on some embedding problems for oriented graphs
Journal of Graph Theory | 2012-06-13 | Paper |
A note on some embedding problems for oriented graphs
Journal of Graph Theory | 2012-06-13 | Paper |
An Ore-type theorem for perfect packings in graphs
SIAM Journal on Discrete Mathematics | 2010-08-27 | 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 |
A note on colour-bias perfect matchings in hypergraphs
(available as arXiv preprint) | N/A | Paper |
