2 citations · 5 across the 5 of their papers we have counts for
15 papers · 1 filter
Rainbow cycles in properly edge-colored graphs
Jaehoon Kim, Joonkyung Lee, Hong Liu +1
We prove that every properly edge-colored -vertex graph with average degree at least contains a rainbow cycle, improving upon bound due to To…
Exponential decay of intersection volume with applications on list-decodability and Gilbert-Varshamov type bound
Jaehoon Kim, Hong Liu, Tuan Tran
We give some natural sufficient conditions for balls in a metric space to have small intersection. Roughly speaking, this happens when the metric space is (i) expanding and (ii) we…
-complexes with unique embeddings in 3-space
Agelos Georgakopoulos, Jaehoon Kim
A well-known theorem of Whitney states that a 3-connected planar graph admits an essentially unique embedding into the 2-sphere. We prove a 3-dimensional analogue: a simply-connect…
Nested cycles with no geometric crossings
Irene Gil Fernández, Jaehoon Kim, Younjin Kim +1
In 1975, Erdős asked the following question: what is the smallest function for which all graphs with vertices and edges contain two edge-disjoint cycles and…
-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…