3 citations · 3 across the 1 of their papers we have counts for
5 papers
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…
Groups with few maximal sum-free sets
Hong Liu, Maryam Sharifzadeh
We show that, in contrast to the integers setting, almost all even order abelian groups have exponentially fewer maximal sum-free sets than , where denotes t…
Structure and Supersaturation for Intersecting Families
József Balogh, Shagnik Das, Hong Liu +2
The extremal problems regarding the maximum possible size of intersecting families of various combinatorial objects have been extensively studied. In this paper, we investigate sup…
On the maximum number of integer colourings with forbidden monochromatic sums
Hong Liu, Maryam Sharifzadeh, Katherine Staden
Let denote the maximum number of colourings of with colours such that each colour class is sum-free. Here, a sum is a subset $\…
The number of subsets of integers with no -term arithmetic progression
József Balogh, Hong Liu, Maryam Sharifzadeh
Addressing a question of Cameron and Erd\Ho s, we show that, for infinitely many values of , the number of subsets of that do not contain a -term arithmet…