34 citations · 63 across the 15 of their papers we have counts for
17 papers
Clustered Colouring of Odd--Minor-Free Graphs
Robert Hickingbotham, Dong Yeap Kang, Sang-il Oum +2
The clustered chromatic number of a graph class is the minimum integer such that every graph has a -colouring where each monochromatic compon…
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…
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…
New bounds on the size of Nearly Perfect Matchings in almost regular hypergraphs
Dong Yeap Kang, Daniela Kühn, Abhishek Methuku +1
Let be a -uniform -regular simple hypergraph on vertices. Based on an analysis of the Rödl nibble, Alon, Kim and Spencer (1997) proved that if , then con…