Daniela Kuhn
University of Birmingham
H-index: 36
Europe-United Kingdom
Top articles of Daniela Kuhn
Title | Journal | Author(s) | Publication Date |
|---|---|---|---|
A special case of Vu’s conjecture: colouring nearly disjoint graphs of bounded maximum degree | Combinatorics, Probability and Computing | Tom Kelly Daniela Kühn Deryk Osthus | 2024/3 |
Hypergraph regularity and random sampling | Random Structures & Algorithms | Felix Joos Jaehoon Kim Daniela Kühn Deryk Osthus | 2023/7 |
Path decompositions of tournaments | Proceedings of the London Mathematical Society | António Girão Bertille Granet Daniela Kühn Allan Lo Deryk Osthus | 2023/2 |
New bounds on the size of nearly perfect matchings in almost regular hypergraphs | Journal of the London Mathematical Society | Dong Yeap Kang Daniela Kühn Abhishek Methuku Deryk Osthus | 2023/11 |
Thresholds for Latin squares and Steiner triple systems: Bounds within a logarithmic factor | Transactions of the American Mathematical Society | Dong Yeap Kang Tom Kelly Daniela Kühn Abhishek Methuku Deryk Osthus | 2023/9 |
A proof of the Erdős--Faber--Lovász conjecture | Annals of Mathematics | Dong Kang Tom Kelly Daniela Kühn Abhishek Methuku Deryk Osthus | 2023/9/1 |
Perfect matchings in random sparsifications of Dirac hypergraphs | arXiv preprint arXiv:2211.01325 | Dong Yeap Kang Tom Kelly Daniela Kühn Deryk Osthus Vincent Pfenninger | 2022/11/2 |
Almost all optimally coloured complete graphs contain a rainbow Hamilton path | Journal of Combinatorial Theory, Series B | Stephen Gould Tom Kelly Daniela Kühn Deryk Osthus | 2022/9/1 |
A proof of the Erdös-Faber-Lovász conjecture: Algorithmic aspects | Dong Yeap Kang Tom Kelly Daniela Kühn Abhishek Methuku Deryk Osthus | 2022/2/7 | |
Decompositions into isomorphic rainbow spanning trees | Journal of Combinatorial Theory, Series B | Stefan Glock Daniela Kühn Richard Montgomery Deryk Osthus | 2021/1/1 |
Extremal aspects of graph and hypergraph decomposition problems. | Stefan Glock Daniela Kühn Deryk Osthus | 2021/6/24 | |
Solution to a problem of Erd\H {o} s on the chromatic index of hypergraphs with bounded codegree | arXiv preprint arXiv:2110.06181 | Dong Yeap Kang Tom Kelly Daniela Kühn Abhishek Methuku Deryk Osthus | 2021/10/12 |
Resolution of the Oberwolfach problem | Journal of the European Mathematical Society | Stefan Glock Felix Joos Jaehoon Kim Daniela Kühn Deryk Osthus | 2021 |
A proof of the Erdös-Faber-Lovász conjecture | arXiv preprint | D Kang Tom Kelly D Kühn Abhishek Methuku Deryk Osthus | 2021 |
Solution to a problem of Erdős on the chromatic index of hypergraphs with bounded codegree | arXiv e-prints | Dong Yeap Kang Tom Kelly Daniela Kühn Abhishek Methuku Deryk Osthus | 2021/10 |
A proof of the Erdős-Faber-Lovász conjecture | arXiv e-prints | Dong Yeap Kang Tom Kelly Daniela Kühn Abhishek Methuku Deryk Osthus | 2021/1 |
Path and cycle decompositions of dense graphs | Journal of the London Mathematical Society | António Girão Bertille Granet Daniela Kühn Deryk Osthus | 2021/10 |
Hamiltonicity of random subgraphs of the hypercube | Padraig Condon Alberto Espuny Díaz António Girao Daniela Kühn Deryk Osthus | 2021 | |
Counting Hamilton cycles in Dirac hypergraphs | Combinatorics, Probability and Computing | Stefan Glock Stephen Gould Felix Joos Daniela Kühn Deryk Osthus | 2021/7 |
Dirac’s theorem for random regular graphs | Combinatorics, Probability and Computing | Padraig Condon Alberto Espuny Díaz António Girão Daniela Kühn Deryk Osthus | 2021/1 |
Co-Authors
