Antimatroids Induced by Matchings
Combinatorics
2018-09-12 v2 Discrete Mathematics
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.
Keywords
Cite
@article{arxiv.1705.05510,
title = {Antimatroids Induced by Matchings},
author = {Yasushi Kawase and Yutaro Yamaguchi},
journal= {arXiv preprint arXiv:1705.05510},
year = {2018}
}