D. Kang

activity

20142023

most citedA relative of Hadwiger's conjecture

34 citations · 63 across the 15 of their papers we have counts for

collaborators

Showing 2021Show all

3 papers · 1 filter

math.CO2021

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 $t, n \in N$ , if $G_{1}, \dots, G_{n}$ are complete graphs such that each $G_{i}$ has at most $n$ vertices and eve…

math.CO2021★ 3 cited

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…

math.CO2021★ 2 cited

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 $n$ vertices is at most $n$ . In this paper, we prove this conjecture f…