D. Kang

collaborators

Showing math.COShow all

5 papers · 1 filter

math.CO2025★ 1 cited

Fragile minor-monotone parameters under random edge perturbation

Dong Yeap Kang, Mihyun Kang, Jaehoon Kim +1

We conduct a quantitative analysis of how many random edges need to be added to a base graph $H$ in order to significantly increase natural minor-monotone graph parameters of the r…

math.CO2024

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 ev…

math.CO2024

New bounds on the size of Nearly Perfect Matchings in almost regular hypergraphs

Dong Yeap Kang, Daniela KÃ¼hn, Abhishek Methuku +1

Let $H$ be a $k$ -uniform $D$ -regular simple hypergraph on $N$ vertices. Based on an analysis of the RÃ¶dl nibble, Alon, Kim and Spencer (1997) proved that if $k \geq 3$ , then $H$ co…

math.CO2024

Clustered Colouring of Odd- $H$ -Minor-Free Graphs

Robert Hickingbotham, Dong Yeap Kang, Sang-il Oum +2

The clustered chromatic number of a graph class $G$ is the minimum integer $c$ such that every graph $G \in G$ has a $c$ -colouring where each monochromatic compon…

math.CO2024

Perfect matchings in random sparsifications of Dirac hypergraphs

Dong Yeap Kang, Tom Kelly, Daniela KÃ¼hn +2

For all integers $n \geq k > d \geq 1$ , let $m_{d} (k, n)$ be the minimum integer $D \geq 0$ such that every $k$ -uniform $n$ -vertex hypergraph $H$ with minimum $d$ -degree $Î…

Fragile minor-monotone parameters under random edge perturbation

Solution to a problem of ErdÅs on the chromatic index of hypergraphs with bounded codegree

New bounds on the size of Nearly Perfect Matchings in almost regular hypergraphs

Clustered Colouring of Odd-H-Minor-Free Graphs

Perfect matchings in random sparsifications of Dirac hypergraphs

Solution to a problem of ErdÅs on the chromatic index of hypergraphs with bounded codegree

Clustered Colouring of Odd- $H$ -Minor-Free Graphs