The number of maximal independent sets in the Hamming cube
Combinatorics
2019-09-12 v2
Abstract
Let be the -dimensional Hamming cube and . We prove that the number of maximal independent sets in is asymptotically as was conjectured by Ilinca and the first author in connection with a question of Duffus, Frankl and R\"odl. The value is a natural lower bound derived from a connection between maximal independent sets and induced matchings. The proof that it is also an upper bound draws on various tools, among them "stability" results for maximal independent set counts and old and new results on isoperimetric behavior in .
Keywords
Cite
@article{arxiv.1909.04283,
title = {The number of maximal independent sets in the Hamming cube},
author = {Jeff Kahn and Jinyoung Park},
journal= {arXiv preprint arXiv:1909.04283},
year = {2019}
}
Comments
20 pages (v2: reference updated)