Strongly maximal matchings in infinite weighted graphs
Combinatorics
2009-11-23 v1
Abstract
Given an assignment of weights w to the edges of a graph G, a matching M in G is called strongly w-maximal if for any matching N the sum of weights of the edges in N\M is at most the sum of weights of the edges in 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.
Keywords
Cite
@article{arxiv.0911.4010,
title = {Strongly maximal matchings in infinite weighted graphs},
author = {Ron Aharoni and Eli Berger and Agelos Georgakopoulos and Philipp Sprüssel},
journal= {arXiv preprint arXiv:0911.4010},
year = {2009}
}
Comments
17 pages