A matching-covered non-bipartite graph exists where every edge lies in some minimum-weight and some maximum-weight perfect matching, yet not all perfect matchings have identical weight.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A hierarchy of edge-weight symmetries in perfect matchings
A matching-covered non-bipartite graph exists where every edge lies in some minimum-weight and some maximum-weight perfect matching, yet not all perfect matchings have identical weight.