3 papers
math.CO2026
On the spectrum and structure of blowup thresholds
Xinqi Huang, Hong Liu, Mingyuan Rong
The chromatic threshold of ErdÅs and Simonovits asks when a minimum-degree condition forces every \(H\)-free graph to have bounded chromatic number. Thomassen's homomorphism thres…
math.CO2026
Triangle packings in randomly perturbed graphs
Xinbu Cheng, Hong Liu, Lanchao Wang +1
The longstanding Nash-Williams conjecture asserts that every -divisible graph with admits a triangle decomposition. In the random setting, Frankl and Rödl…
math.CO2025
Interpolating chromatic and homomorphism thresholds
Xinqi Huang, Hong Liu, Mingyuan Rong +1
The problem of chromatic thresholds seeks for minimum degree conditions that ensure -free graphs to have a bounded chromatic number, or equivalently a bounded size homomorphic i…