Extremal Graph Theory
The extremal function ex(n,H): Mantel and Turán with proofs and the unique extremal graph, supersaturation and stability, Kővári–Sós–Turán and Erdős–Stone, and the regularity and removal lemmas behind Roth, Szemerédi and Green–Tao.0/13 masteredUse the Turán recursion tr(n)=tr(n−r)+(2r)+(r−1)(n−r) with r=3, n=9 and t3(6)=12 to compute t3(9). Review the explanation for this topic →Type your answer — press Enter to checkEnter your answer