Jaehoon Kim

activity

20112023

most citedOn a rainbow version of Dirac's theorem

47 citations · 231 across the 46 of their papers we have counts for

collaborators

Showing 2016Show all

5 papers · 1 filter

math.CO2016★ 17 cited

Strong edge-colorings of sparse graphs with large maximum degree

Ilkyoo Choi, Jaehoon Kim, Alexandr V. Kostochka +1

A {\em strong $k$ -edge-coloring} of a graph $G$ is a mapping from $E (G)$ to ${1, 2, \dots, k}$ such that every two adjacent edges or two edges adjacent to the same edge receive dis…

math.CO2016

Optimal packings of bounded degree trees

Felix Joos, Jaehoon Kim, Daniela Kühn +1

We prove that if $T_{1}, \dots, T_{n}$ is a sequence of bounded degree trees so that $T_{i}$ has $i$ vertices, then $K_{n}$ has a decomposition into $T_{1}, \dots, T_{n}$ . This shows that the tr…

math.CO2016★ 3 cited

Two-regular subgraphs of odd-uniform hypergraphs

Jie Han, Jaehoon Kim

Let $k \geq 3$ be an odd integer and let $n$ be a sufficiently large integer. We prove that the maximum number of edges in an $n$ -vertex $k$ -uniform hypergraph containing no $2$ -regu…

math.CO2016★ 5 cited

A blow-up lemma for approximate decompositions

Jaehoon Kim, Daniela Kühn, Deryk Osthus +1

We develop a new method for constructing approximate decompositions of dense graphs into sparse graphs and apply it to longstanding decomposition problems. For instance, our result…

math.CO2016★ 3 cited

Sparse spanning $k$ -connected subgraphs in tournaments

Dong Yeap Kang, Jaehoon Kim, Younjin Kim +1

In 2009, Bang-Jensen asked whether there exists a function $g (k)$ such that every strongly $k$ -connected $n$ -vertex tournament contains a strongly $k$ -connected spanning subgraph w…

Strong edge-colorings of sparse graphs with large maximum degree

Optimal packings of bounded degree trees

Two-regular subgraphs of odd-uniform hypergraphs

A blow-up lemma for approximate decompositions

Sparse spanning k-connected subgraphs in tournaments

Sparse spanning $k$ -connected subgraphs in tournaments