58 citations · 220 across the 56 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
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…
math.PR2019
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 $…