×

zbMATH — the first resource for mathematics

On a max-min problem concerning weights of edges. (English) Zbl 1012.05091
Summary: The weight \(w(e)\) of an edge \(e=uv\) of a graph is defined to be the sum of degrees of the vertices \(u\) and \(v\). In 1990 P. Erdős asked the question: What is the minimum weight of an edge of a graph having \(n\) vertices and \(m\) edges? This paper brings a precise answer to the above question of Erdős.

MSC:
05C35 Extremal problems in graph theory
PDF BibTeX XML Cite
Full Text: DOI