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.