Kővári–Sós–Turán theorem

For each fixed positive integer $t$,The standard proof counts $t$-element subsets of graph neighbourhoods in a bipartite subgraph. If one side has degrees $d_y$, the absence of $K_{t,t}$ givesconvexity then bounds the number of edges.