Research output per year
Research output per year
Research output
- 8 Article
Search results
-
2023
A proof of the Erdos-Faber-Lovasz conjecture
Kang, D. Y., Kelly, T., Kuhn, D., Methuku, A. & Osthus, D., Sept 2023, In: Annals of Mathematics. 198, 2, p. 537-618 82 p.Research output: Contribution to journal › Article › peer-review
Open AccessFile56 Downloads (Pure) -
A special case of Vu’s conjecture: colouring nearly disjoint graphs of bounded maximum degree
Kelly, T., Kühn, D. & Osthus, D., 10 Nov 2023, (E-pub ahead of print) In: Combinatorics, Probability and Computing. p. 1-17Research output: Contribution to journal › Article › peer-review
Open AccessFile20 Downloads (Pure) -
New bounds on the size of nearly perfect matchings in almost regular hypergraphs
Kang, D. Y., Kühn, D., Methuku, A. & Osthus, D., 31 Jul 2023, (E-pub ahead of print) In: Journal of the London Mathematical Society. 46 p.Research output: Contribution to journal › Article › peer-review
Open AccessFile29 Downloads (Pure) -
Path decompositions of tournaments
Ferra Gomes De Almeida Girao, A. J., Granet, B., Kuhn, D., Lo, A. & Osthus, D., 19 Jan 2023, (E-pub ahead of print) In: Proceedings of the London Mathematical Society.Research output: Contribution to journal › Article › peer-review
Open AccessFile91 Downloads (Pure) -
2022
Almost all optimally coloured complete graphs contain a rainbow Hamilton path
Gould, S., Kelly, T., Kuhn, D. & Osthus, D., Sept 2022, In: Journal of Combinatorial Theory. Series B. 156, p. 57-100 44 p.Research output: Contribution to journal › Article › peer-review
Open AccessFile20 Downloads (Pure) -
Hamilton transversals in random Latin squares
Gould, S. & Kelly, T., 14 Jun 2022, (E-pub ahead of print) In: Random Structures and Algorithms.Research output: Contribution to journal › Article › peer-review
Open AccessFile41 Downloads (Pure) -
2021
Colorings, transversals, and local sparsity
Kang, R. J. & Kelly, T., 13 Oct 2021, (E-pub ahead of print) In: Random Structures and Algorithms. 20 p.Research output: Contribution to journal › Article › peer-review
Open AccessFile28 Downloads (Pure) -
2020
The existence of designs via iterative absorption: hypergraph F-designs for arbitrary F
Glock, S., Kuhn, D., Lo, A. & Osthus, D., 28 Feb 2020, (Accepted/In press) In: Memoirs of the American Mathematical Society.Research output: Contribution to journal › Article › peer-review