Abstract
Let rex(n,F) denote the maximum number of edges in an n-vertex graph that is regular and does not contain F as a subgraph. We give lower bounds on rex(n,F), that are best possible up to a constant factor, when F is one of C4, K2,t, K3,3 or Ks,t for t>s!.