81 citations · 797 across the 72 of their papers we have counts for
80 papers · 1 filter
Perfect matchings in random sparsifications of Dirac hypergraphs
Dong Yeap Kang, Tom Kelly, Daniela Kühn +2
For all integers , let be the minimum integer such that every -uniform -vertex hypergraph with minimum -degree $δ…
Solution to a problem of Erdős on the chromatic index of hypergraphs with bounded codegree
Dong Yeap Kang, Tom Kelly, Daniela Kühn +2
In 1977, Erdős asked the following question: for any integers , if are complete graphs such that each has at most vertices and eve…
Hypergraph regularity and random sampling
Felix Joos, Jaehoon Kim, Daniela Kühn +1
Suppose a -uniform hypergraph that satisfies a certain regularity instance (that is, there is a partition of given by the hypergraph regularity lemma into a bounded numb…
A special case of Vu's conjecture: Coloring nearly disjoint graphs of bounded maximum degree
Tom Kelly, Daniela Kühn, Deryk Osthus
A collection of graphs is \textit{nearly disjoint} if every pair of them intersects in at most one vertex. We prove that if are nearly disjoint graphs of maximum…
Graph and hypergraph colouring via nibble methods: A survey
Dong Yeap Kang, Tom Kelly, Daniela Kühn +2
This paper provides a survey of methods, results, and open problems on graph and hypergraph colourings, with a particular emphasis on semi-random `nibble' methods. We also give a d…
A proof of the Erdős-Faber-Lovász conjecture
Dong Yeap Kang, Tom Kelly, Daniela Kühn +2
The Erdős-Faber-Lovász conjecture (posed in 1972) states that the chromatic index of any linear hypergraph on vertices is at most . In this paper, we prove this conjecture f…