Antimatroids induced by matchings

Yasushi Kawase, Yutaro Yamaguchi

Research output: Contribution to journalArticlepeer-review

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.

Original languageEnglish
Pages (from-to)342-349
Number of pages8
JournalDiscrete Applied Mathematics
Volume257
DOIs
Publication statusPublished - Mar 31 2019
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Antimatroids induced by matchings'. Together they form a unique fingerprint.

Cite this