Stability for maximal independent sets
Combinatorics
2018-08-22 v1
Abstract
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).
Cite
@article{arxiv.1808.06666,
title = {Stability for maximal independent sets},
author = {Jeff Kahn and Jinyoung Park},
journal= {arXiv preprint arXiv:1808.06666},
year = {2018}
}
Comments
11 pages