On a Max-min Problem Concerning Weights of Edges

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 G having n vertices and m edges? This paper brings a precise answer to the above question of Erdős.

This is a preview of subscription content, access via your institution.

Author information



Additional information

Received July 12, 1999

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Jendrol', S., Schiermeyer, I. On a Max-min Problem Concerning Weights of Edges. Combinatorica 21, 351–359 (2001). https://doi.org/10.1007/s004930100001

Download citation

  • AMS Subject Classification (2000) Classes:  05C35