3 citations · 7 across the 10 of their papers we have counts for
20 papers
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…
Disjoint isomorphic balanced clique subdivisions
Irene Gil Fernández, Joseph Hyde, Hong Liu +2
A thoroughly studied problem in Extremal Graph Theory is to find the best possible density condition in a host graph for guaranteeing the presence of a particular subgraph …
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…
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…
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…
Bivariate fluctuations for the number of arithmetic progressions in random sets
Yacine Barhoumi-Andréani, Christoph Koch, Hong Liu
We study arithmetic progressions , with , in random subsets of the initial segment of natural numbers . Given $…