3 papers
math.CO2026
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 bo…
math.CO2025
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…
math.CO2025
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…