报告题目：Chromatic, homomorphism and blowup thresholds

报告人：刘鸿，Institute for Basic Science (IBS)

时间：4月10日（周四）15:45-16:45

地点：五教5306

摘要：

I will talk about the classical chromatic/homomorphism thresholds problems which studies density conditions that guarantee an H-free graph to have bounded complexity. I will survey somerecent developments, including an unexpected connection to the theory of VC dimension and also discrete geometry, a novel asymmetric version that we introduce to interpolate these two problems. If time permits, I will discuss two related problems, blowup and VC thresholds.