The sum of the squares of degrees: an overdue assignement
Abstract
Description
Let 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), better than the bound of de Caen for almost all n and m.
Removed some terrible mistakes from the first version
Removed some terrible mistakes from the first version