The sum of the squares of degrees: Sharp asymptotics

Let f(n,m)f(n,m) be the maximum of the sum of the squares of degrees of a graph with n vertices and m   edges. Summarizing earlier research, we present a concise, asymptotically sharp upper bound on f(n,m)f(n,m), better than the bound of de Caen for almost all n   and m.m.