Antimatroids Induced by Matchings
classification
🧮 math.CO
cs.DM
keywords
matchingsantimatroidantimatroidsinducedmaximum-weightstableadmitsbipartite
read the original abstract
We explore novel connections between antimatroids and matchings in bipartite graphs. In particular, we prove that a combinatorial structure induced by stable matchings or maximum-weight matchings is an antimatroid. Moreover, we demonstrate that every antimatroid admits such a representation by stable matchings and maximum-weight matchings.
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.