The sum of the squares of degrees: an overdue assignement
Vladimir Nikiforov
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.
Create a lesson
Related papers
Szemerédi's theorem with random differences and arithmetic Kakeya
Gabriel Dahia
A proof of the rational exponents conjecture
David Conlon, Oliver Janzer, Tao Jiang et al.
Proofs of four Takigiku--Tsuchioka conjectures on level 2 principal characters of A2-1(2)
Liuquan Wang
Two conjectures on the cospectrality of complete tripartite graphs are false
Irena M. Jovanović, Jelena Sedlar, Riste Škrekovski
Saturation and semisaturation of oriented graphs
Vladimir Bošković, Balázs Keszegh
Spectral radius and edge-disjoint spanning trees of graphs with edge connectivity
Jia Wei, Muhuo Liu, Zhifu You et al.