Kim, Jaehoon (김재훈)

Jaehoon Kim is an Associate Professor at the Korea Advanced Institute of Science and Technology (KAIST) in the Department of Mathematics. His research interests include Graph Theory. He is based at E6-1 3401, T2740, and can be contacted via email at jaehoon.kim@kaist.ac.kr. Kim holds a Ph.D. from the University of Illinois Urbana-Champaign. His profile page indicates he is also an Endowed Chair professor at KAIST, with a specified term from September 2025 to August 2028. His academic work focuses on combinatorics and graph theory, and he maintains an online presence through a Google Sites page.

Jaehoon Kim is a researcher in Discrete Mathematics, Combinatorics, and Graph theory. His work focuses on various aspects of graph colorings, including r-dynamic coloring, rainbow structures, and improper coloring of sparse graphs. He has contributed to resolving long-standing problems such as the Oberwolfach problem and proving Komlós's conjecture on Hamiltonian subsets. His research also explores spanning trees in randomly perturbed graphs, conflict-free hypergraph matchings, and extremal density for sparse minors. Kim's publications often intersect with combinatorial optimization and extremal graph theory, emphasizing the interplay between structural properties and coloring constraints.