The sum of the squares of degrees: an overdue assignement
classification
🧮 math.CO
keywords
bounddegreessquaresalmostassignementasymptoticallybettercaen
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.