The sum of the squares of degrees: an overdue assignement

Simple item page
dc.creatorNikiforov, Vladimir
dc.date2006-08-26
dc.date2006-09-28
dc.date.accessioned2026-07-07T07:22:12Z
dc.date.available2026-07-07T07:22:12Z
dc.descriptionLet 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.
dc.descriptionRemoved some terrible mistakes from the first version
dc.identifierhttps://arxiv.org/abs/math/0608660
dc.identifierhttp://arxiv.org/abs/math/0608660
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/115576
dc.subjectCombinatorics
dc.subject05C07
dc.titleThe sum of the squares of degrees: an overdue assignement
dc.typetext

Files

Collections

arXiv