Every stable matching is at least half the size of a maximum matching, and the paper's 'characterization' of the bound is essentially a restatement of its definition.
Kernels in perfect line-graphs
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
econ.TH 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Note on the size of a stable matching
Every stable matching is at least half the size of a maximum matching, and the paper's 'characterization' of the bound is essentially a restatement of its definition.