Optimal packings of bounded degree trees [arXiv, talk] Felix Joos, Jaehoon Kim, Daniela Kühn and Deryk Osthus
to appear in Journal of the European Mathematical Society, 55 pages
A blow-up lemma for approximate decompositions [arXiv]
Jaehoon Kim, Daniela Kühn, Deryk Osthus and Mykhaylo Tyomkyn
to appear in Transactions of the American Mathematical Society, 69 pages
2018
Forbidding induced even cycles in a graph: typical structure and counting [arXiv]
Jaehoon Kim, Daniela Kühn, Deryk Osthus and Timothy Townsend Journal of Combinatorial Theory Series B 131 (2018), 170-219.
Dynamic choosability of triangle-free graphs and sparse random graphs [arXiv]
Jaehoon Kim and Seongmin Ok Journal of Graph Theory 87 (2018), 347-355
Two-regular subgraphs of odd-uniform hypergraphs [arXiv] Jie Han and Jaehoon Kim Journal of Combinatorial Theory Series B 128 (2018), 175-191.
Sparse spanning k-connected subgraphs in tournaments [arXiv]
Jaehoon Kim, Dong Yeap Kang, Younjin Kim and Geewon Suh SIAM Journal on Discrete Mathematics 31(3) (2017), 2206-2227
On the number of r-matchings in a tree [pdf] Dong Yeap Kang, Jaehoon Kim, Younjin Kim and Hiu-Fai Law Electronic Journal of Combinatorics 24(1) (2017), #P1.24
2016
Bipartitions of highly connected tournaments [pdf]
Jaehoon Kim, Daniela Kühn and Deryk Osthus SIAM Journal on Discrete Mathematics 30(2) (2016), 895-911
Regular subgraphs of uniform hypergraphs [arXiv, talk]
Jaehoon Kim Journal of Combinatorial Theory Series B 119 (2016), 214-236
Improper coloring of sparse graphs with a given girth, II: constructions [
pdf]
Jaehoon Kim, Alexandr V. Kostochka and Xuding Zhu Journal of Graph Theory 81 (2016), 403-413
The difference and ratio of the fractional matching number and the matching number of graphs [arXiv] Ilkyoo Choi, Jaehoon Kim and Suil O Discrete Mathematics 339 (2016), 1382-1386
On the Erdös-Ko-Rado Theorem and Bollobás theorem for t-intersecting families [arXiv] Dong Yeap Kang, Jaehoon Kim and Younjin Kim European Journal of Combinatorics 47 (2015), 68-74
2014
Improper coloring of sparse graphs with a given girth,
I: (0,1)-colorings of triangle-free graphs [pdf]
Jaehoon Kim, Alexandr V. Kostochka and Xuding Zhu European Journal of Combinatorics 42 (2014), 26-48
Equicovering subgraphs of graphs and hypergraphs [pdf] Ilkyoo Choi, Jaehoon Kim, Amelia Tebbe and Douglas West Electronic Journal of Combinatorics 21(1) (2014), #P1.62
Ramsey-minimal saturation numbers for matchings [pdf] Michael Ferrara, Jaehoon Kim and Elyse Yeager Discrete Mathematics 322 (2014), 26-30
Maximum hypergraphs without regular subgraphs [pdf, talk]
Jaehoon Kim and Alexandr V. Kostochka Discussiones Mathematicae Graph Theory 34 (2014), 151–166
2013
Average connectivity and average edge-connectivity in graphs [pdf]
Jaehoon Kim and Suil O Discrete Mathematics 313 (2013), 2232-2238
New results in t-tone coloring of graphs [arXiv] Dan Cranston, Jaehoon Kim and Bill Kinnersley Electnonic Journal of Combinatorics 20(2) (2013), #P17
2012
Harmonious coloring of trees with large maximum degree [arXiv] Saieed Akbari, Jaehoon Kim and Alexandr V. Kostochka Discrete Mathematics 312 (2012), 1633-1637