Strongly maximal matchings in infinite weighted graphs

Details Strongly maximal matchings in infinite weighted graphs Strongly maximal matchings in infinite weighted graphs

2009-11-20

arxiv.org/abs/0911.4010v1

Electronic Journal of Combinatorics 15 (2008), #R136

Mathematics

Combinatorics

17 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Strongly maximal matchings in infinite weighted graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Strongly maximal matchings in infinite weighted graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Strongly maximal matchings in infinite weighted graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-432165