
arXiv: 1705.05510
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.
FOS: Computer and information sciences, stable matchings, bipartite graphs, Discrete Mathematics (cs.DM), Combinatorial aspects of matroids and geometric lattices, antimatroids, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), weighted matchings, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), Computer Science - Discrete Mathematics
FOS: Computer and information sciences, stable matchings, bipartite graphs, Discrete Mathematics (cs.DM), Combinatorial aspects of matroids and geometric lattices, antimatroids, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), weighted matchings, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), Computer Science - Discrete Mathematics
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
