5 citations · 5 across the 6 of their papers we have counts for
9 papers
A proof of the rational exponents conjecture
David Conlon, Oliver Janzer, Tao Jiang +5
The rational exponents conjecture of Erdős and Simonovits asserts that for every rational there exists a graph such that . We present a pr…
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…
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…
Ore-type conditions for existence of a jellyfish in a graph
Jaehoon Kim, Alexandr Kostochka, Ruth Luo
The famous Dirac's Theorem states that for each every -vertex graph with minimum degree has a hamiltonian cycle. When , this cannot be gu…
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…
Fractional Helly theorem for Cartesian products of convex sets
Debsoumya Chakraborti, Jaehoon Kim, Jinha Kim +2
Helly's theorem and its variants show that for a family of convex sets in Euclidean space, local intersection patterns influence global intersection patterns. A classical result of…
Well-mixing vertices and almost expanders
Debsoumya Chakraborti, Jaehoon Kim, Jinha Kim +2
We study regular graphs in which the random walks starting from a positive fraction of vertices have small mixing time. We prove that any such graph is virtually an expander and ha…