Strongly maximal matchings in infinite weighted graphs
classification
🧮 math.CO
keywords
edgesmatchingstronglyweightsw-maximalassignmentassumescalled
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.