5 citations · 5 across the 8 of their papers we have counts for
10 papers
The Erdős-Gallai bound for consecutive even cycle lengths
Yaobin Chen, Hong Liu, Xia Wang +2
Erdős and Gallai in 1959 proved the seminal result that every -vertex graph with no cycle of length at least has at most edges. We prove the extens…
Small circumference in regular sublinear expanders
Yaobin Chen, Hong Liu, Xin Wei +1
Sublinear expansion is weak enough to be extracted from arbitrary graphs while retaining nearly all of their average degree, yet it has proved strong enough to force global structu…
Strong invariants and Tverberg numbers in convexity spaces
Minho Cho, Andreas F. Holmsen, Attila Jung +1
Helly, Carathéodory, and Radon numbers encode three kinds of finite certificates in a convexity space: for the emptiness of an intersection, for membership in a convex hull, and fo…
Stability with minuscule structure for chromatic thresholds
Jaehoon Kim, Hong Liu, Chong Shangguan +3
The chromatic threshold of a graph is the infimum of such that the chromatic number of every -vertex -free graph with minimum degree at least is boun…
On the order of intersecting hypergraphs
Stijn Cambie, Jaehoon Kim, Hyunwoo Lee +2
Determining the maximum number of edges in an intersecting hypergraph on a fixed ground set under additional constraints is one of the central topics in extremal combinatorics. In…
Isodiametric inequality for vector spaces
Jiaqi Liao, Hong Liu, Guiying Yan
A theorem of Kleitman states that a collection of binary vectors with diameter d has cardinality at most that of a Hamming ball of radius d/2. In this paper, we give a q-analog of…
New lower bound on ball packing density in high-dimensional hyperbolic spaces
Irene Gil Fernández, Jaehoon Kim, Hong Liu +1
We present a new lower bound on the Bowen-Radin maximal density of radius-R ball packings in the m-dimensional hyperbolic space, improving on the basic covering bound by factor Ω(m…
Optimal bounds on the polynomial Schur's theorem
Jaehoon Kim, Hong Liu, Péter Pál Pach
Liu, Pach and Sándor recently characterized all polynomials such that the equation is -Ramsey, that is, any -coloring of contains infinitely ma…
Extremal density for subdivisions with length or sparsity constraints
Jaehoon Kim, Hong Liu, Yantao Tang +3
Given a graph , a balanced subdivision of is obtained by replacing all edges of with internally disjoint paths of the same length. In this paper, we prove that for any g…
Energy estimates in sum-product and convexity problems
Akshat Mudgal
We prove a new class of low-energy decompositions which, amongst other consequences, imply that any finite set of integers may be written as , where and a…