Jaehoon Kim

collaborators

2 papers

math.CO2026

On Universal Graphs for Trees and Tree-Like Graphs

Neel Kaul, Jaehoon Kim, Minseo Kim +1

Chung and Graham [J. London Math. Soc. 1983] claimed to prove that there exists an $n$ -vertex graph $G$ with $\frac{5}{2} n lo g_{2} n + O (n)$ edges that contains every $n$ -vertex tr…

math.CO2025

On the size of universal graphs for spanning trees

Jaehoon Kim, Minseo Kim

Chung and Graham [J. London Math. Soc., 1983] claimed that there exists an $n$ -vertex graph $G$ containing all $n$ -vertex trees as subgraphs that has at most $\frac{5}{2}n \log_2 n…