Skip to main content
SpringerLink
Log in

On a Max-min Problem Concerning Weights of Edges

  • Original Paper
  • Published:
Combinatorica Aims and scope Submit manuscript

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, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Department of Geometry and Algebra, P. J. Šafárik University; 04154 Košice, Slovak Republic; E-mail: jendrol@kosice.upjs.sk, , , , , , SK

    Stanislav Jendrol'

  2. Fakultät für Mathematik und Informatik, Technische Universität Bergakademie Freiberg; D-09596 Freiberg, Germany; E-mail: schierme@math.tu-freiberg.de, , , , , , DE

    Ingo Schiermeyer

Authors
  1. Stanislav Jendrol'
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ingo Schiermeyer
    View author publications

    You can also search for this author in PubMed Google Scholar

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

  • Issue Date:

  • DOI: https://doi.org/10.1007/s004930100001

Search

Navigation