Sparse halves in triangle-free graphs

One of Erdősʹ favourite conjectures was that any triangle-free graph G on n vertices should contain a set of n / 2 vertices that spans at most n 2 / 50 edges. We prove this when the number of edges in G is either at most n 2 / 12 or at least n 2 / 5 .