Strongly maximal matchings in infinite weighted graphs

Ron Aharoni, Agelos Georgakopoulos, Eli Berger, Philipp Sprüssel

Research output: Contribution to journalArticlepeer-review


Given an assignment of weights w to the edges of an infinite graph G, a matching M in G is called strongly w-maximal if for any matching N there holds ∑{w(e) | e ∈ N \ M} ≤ ∑{w(e) | e ∈ M \ N}. We prove that if w assumes only finitely many values all of which are rational then G has a strongly w-maximal matching. This result is best possible in the sense that if we allow irrational values or infinitely many values then there need not be a strongly w-maximal matching.

Original languageEnglish
Article numberR136
JournalElectronic Journal of Combinatorics
Issue number1 R
StatePublished - 29 Oct 2008

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Geometry and Topology
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics
  • Applied Mathematics


Dive into the research topics of 'Strongly maximal matchings in infinite weighted graphs'. Together they form a unique fingerprint.

Cite this