NewEvery arXiv paper, its researchers & institutions — mapped.
papers

Publications (23)

math.CO2018

Dynamic choosability of triangle-free graphs and sparse random graphs

Jaehoon Kim, Seongmin Ok

math.CO2012

Harmonious Coloring of Trees with Large Maximum Degree

Saieed Akbari, Jaehoon Kim, Alexandr Kostochka

math.CO2017

A blow-up lemma for approximate decompositions

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

math.CO2019

Optimal packings of bounded degree trees

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

math.CO2016

Regular subgraphs of uniform hypergraphs

Jaehoon Kim

math.CO2018

Strong edge-colorings of sparse graphs with large maximum degree

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

math.CO2015

The difference and ratio of the fractional matching number and the matching number of graphs

Ilkyoo Choi, Jaehoon Kim, Suil O

math.CO2018

Spanning trees in randomly perturbed graphs

Felix Joos, Jaehoon Kim

math.CO2018

Two-regular subgraphs of odd-uniform hypergraphs

Jie Han, Jaehoon Kim

math.CO2015

A relative of Hadwiger's conjecture

Katherine Edwards, Dong Yeap Kang, Jaehoon Kim +2

math.CO2018

On the rational Turán exponents conjecture

Dong Yeap Kang, Jaehoon Kim, Hong Liu

cond-mat.mtrl-sci2017

Catalyst design using actively learned machine with non-ab initio input features towards CO2 reduction reactions

Juhwan Noh, Jaehoon Kim, Seoin Back +1

math.CO2011

New results in $t$-tone coloring of graphs

Daniel W. Cranston, Jaehoon Kim, William B. Kinnersley

math.CO2018

Two conjectures in Ramsey-Turán theory

Jaehoon Kim, Younjin Kim, Hong Liu

math.CO2015

Bipartitions of highly connected tournaments

Jaehoon Kim, Daniela Kühn, Deryk Osthus

math.CO2018

Tree decompositions of graphs without large bipartite holes

Jaehoon Kim, Younjin Kim, Hong Liu

math.CO2019

On 1-factors with prescribed lengths in tournaments

Dong Yeap Kang, Jaehoon Kim

math.CO2014

On the number of $r$-matchings in a Tree

Dong Yeap Kang, Jaehoon Kim, Younjin Kim +1

math.CO2018

Sparse spanning $k$-connected subgraphs in tournaments

Dong Yeap Kang, Jaehoon Kim, Younjin Kim +1

math.CO2015

Forbidding induced even cycles in a graph: typical structure and counting

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

math.CO2014

On the Erdos-Ko-Rado Theorem and the Bollobas Theorem for t-intersecting families

Dong Yeap Kang, Jaehoon Kim, Younjin Kim

math.CO2018

A bandwidth theorem for approximate decompositions

Padraig Condon, Jaehoon Kim, Daniela Kühn +1

math.CO2017

Proof of Komlós's conjecture on Hamiltonian subsets

Jaehoon Kim, Hong Liu, Maryam Sharifzadeh +1