47 citations · 231 across the 46 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
math.CO2019★ 47 cited
On a rainbow version of Dirac's theorem
Felix Joos, Jaehoon Kim
For a collection of not necessarily distinct graphs on the same vertex set , a graph with vertices in is a -transversal if th…
math.CO2019★ 2 cited
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…