Making big graphs using small varieties

Abstract: A basic problem in extremal graph theory is to find large graphs
that contain no copy of a specific subgraph. Surprisingly, in
essentially all the known instances, the best constructions for this
problem come from appropriate varieties. I will present several such
constructions, and give a survey of the area.