3 papers
math.CO2026
Exact Homomorphism Thresholds Beyond Cliques
Xinqi Huang, Mingyuan Rong, Chong Shangguan
The chromatic threshold, originating in a question of Erdős and Simonovits, asks when a linear minimum-degree condition forces bounded chromatic number in H-free graphs. Motivated…
math.CO2025
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…
math.CO2024
Focal-free uniform hypergraphs and codes
Xinqi Huang, Chong Shangguan, Xiande Zhang +1
Motivated by the study of a variant of sunflowers, Alon and Holzman recently introduced focal-free hypergraphs. In this paper, we show that there is an interesting connection betwe…