2 citations · 3 across the 2 of their papers we have counts for
11 papers
-saturated graphs with small spectral radius
Jaehoon Kim, Seog-Jin Kim, Alexandr V. Kostochka +1
For a graph , a graph is -saturated if does not contain as a subgraph but for any , contains . In this note, we prove a sharp lowe…
Asymptotic Structure for the Clique Density Theorem
Jaehoon Kim, Hong Liu, Oleg Pikhurko +1
The famous Erdős-Rademacher problem asks for the smallest number of -cliques in a graph with the given number of vertices and edges. Despite decades of active attempts, the asym…
On the rational Turán exponents conjecture
Dong Yeap Kang, Jaehoon Kim, Hong Liu
The extremal number of a graph is the maximum number of edges in an -vertex graph not containing as a subgraph. A real number is realisa…
Resilient degree sequences with respect to Hamilton cycles and matchings in random graphs
Padraig Condon, Alberto Espuny Díaz, Jaehoon Kim +2
Pósa's theorem states that any graph whose degree sequence satisfies for all has a Hamilton cycle. This degree condition is bes…
Tree decompositions of graphs without large bipartite holes
Jaehoon Kim, Younjin Kim, Hong Liu
A recent result of Condon, Kim, Kühn and Osthus implies that for any , an -vertex almost -regular graph has an approximate decomposition into a…
Resolution of the Oberwolfach problem
Stefan Glock, Felix Joos, Jaehoon Kim +2
The Oberwolfach problem, posed by Ringel in 1967, asks for a decomposition of into edge-disjoint copies of a given -factor. We show that this can be achieved for all…