58 citations · 220 across the 56 of their papers we have counts for
9 papers · 1 filter
On the rational Turán exponents conjecture
Dong Yeap Kang, Jaehoon Kim, Hong Liu
The extremal number of a graph is the maximum number of edges in an -vertex graph not containing as a subgraph. A real number is realisa…
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…
Polynomial Schur's theorem
Hong Liu, Péter Pál Pach, Csaba Sándor
We resolve the Ramsey problem for for all polynomials over . In particular, we characterise all polynomials that are -Ramsey, that is, those…
Tree decompositions of graphs without large bipartite holes
Jaehoon Kim, Younjin Kim, Hong Liu
A recent result of Condon, Kim, Kühn and Osthus implies that for any , an -vertex almost -regular graph has an approximate decomposition into a…
The number of multiplicative Sidon sets of integers
Hong Liu, Péter Pál Pach
A set of natural numbers is multiplicative Sidon if the products of all pairs in are distinct. Erdős in 1938 studied the maximum size of a multiplicative Sidon subset of $\…
A degree sequence Komlós theorem
Joseph Hyde, Hong Liu, Andrew Treglown
An important result of Komlós [Tiling Turán theorems, Combinatorica, 2000] yields the asymptotically exact minimum degree threshold that ensures a graph contains an -tiling…
The number of maximum primitive sets of integers
Hong Liu, Péter Pál Pach, Richárd Palincza
A set of integers is \emph{primitive} if it does not contain an element dividing another. Denote by the number of maximum-size primitive subsets of . We pr…
Two conjectures in Ramsey-Turán theory
Jaehoon Kim, Younjin Kim, Hong Liu
Given graphs , a graph is -free if there is a -edge-colouring with no monochromatic copy of with edges of c…
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…