Title: Chromatic, homomorphism and blowup thresholds

Presenter: Hong Liu, Institute for Basic Science (IBS)

Time: 15:45 - 16:45, Thursday, April 10th

Venue: Classroom 5306, the 5th Teaching Building

Abstract:

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 some recent 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.