Publications Influence

Share This Author

## A Relative of Hadwiger's Conjecture

- Katherine Edwards, Dong Yeap Kang, Jaehoon Kim, Sang-il Oum, P. Seymour
- MathematicsSIAM J. Discret. Math.
- 20 July 2014

TLDR

## A blow-up lemma for approximate decompositions

- Jaehoon Kim, D. Kuhn, D. Osthus, Mykhaylo Tyomkyn
- Computer ScienceTransactions of the American Mathematical Society
- 25 April 2016

<p>We develop a new method for constructing approximate decompositions of dense graphs into sparse graphs and apply it to long-standing decomposition problems. For instance, our results imply the… Expand

## Optimal packings of bounded degree trees

- Felix Joos, Jaehoon Kim, D. Kuhn, D. Osthus
- MathematicsJournal of the European Mathematical Society
- 13 June 2016

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 tree packing… Expand

## Ramsey-minimal saturation numbers for matchings

- M. Ferrara, Jaehoon Kim, E. Yeager
- MathematicsDiscret. Math.
- 1 May 2014

## On a rainbow version of Dirac's theorem

- Felix Joos, Jaehoon Kim
- MathematicsBulletin of the London Mathematical Society
- 3 October 2019

For a collection G={G1,⋯,Gs} of not necessarily distinct graphs on the same vertex set V , a graph H with vertices in V is a G ‐transversal if there exists a bijection ϕ:E(H)→[s] such that e∈E(Gϕ(e))… Expand

## Extremal Density for Sparse Minors and Subdivisions

- J. Haslegrave, Jaehoon Kim, Hong Liu
- MathematicsTrends in Mathematics
- 3 December 2020

We prove an asymptotically tight bound on the extremal density guaranteeing subdivisions of bounded-degree bipartite graphs with a mild separability condition. As corollaries, we answer several… Expand

## On r-dynamic coloring of graphs

- S. Jahanbekam, Jaehoon Kim, O. Suil, D. West
- MathematicsDiscret. Appl. Math.
- 19 June 2016

## Improper coloring of sparse graphs with a given girth, I: (0, 1)-colorings of triangle-free graphs

- Jaehoon Kim, A. Kostochka, Xuding Zhu
- MathematicsEur. J. Comb.
- 1 November 2014

## Rainbow structures in locally bounded colorings of graphs

- Jaehoon Kim, Daniela Kühn, A. Kupavskii, D. Osthus
- MathematicsRandom Structures & Algorithms
- 22 May 2018

We study approximate decompositions of edge‐colored quasirandom graphs into rainbow spanning structures: an edge‐coloring of a graph is locally ℓ‐bounded if every vertex is incident to at most ℓ… Expand

## Spanning trees in randomly perturbed graphs

- Felix Joos, Jaehoon Kim
- MathematicsRandom Struct. Algorithms
- 13 March 2018

TLDR

...

1

2

3

4

5

...