  Answering questions of Y. Rabinovich, we prove "stability" versions of upper
bounds on maximal independent set counts in graphs under various restrictions.
Roughly these say that being close to the maximum implies existence of a large
induced matching or triangle matching (depending on assumptions).
