📐 Erdős-Stone Theorem
For any graph $H$ with $\\chi(H) = r \\geq 2$: $ex(n, H) = \\left(1 - \\frac{1}{r-1} + o(1)\\right)\\binom{n}{2}$.
From: Introduction to Graph Theory
Learn more: https://west-graphs-deploy.vercel.app/#/section/26
Explore all courses: https://mathacademy-cyan.vercel.app