Note on the number of balanced independent sets in the Hamming cube
The electronic journal of combinatorics, Tome 29 (2022) no. 2
Let $Q_d$ be the $d$-dimensional Hamming cube and $N=|V(Q_d)|=2^d$. An independent set $I$ in $Q_d$ is called balanced if $I$ contains the same number of even and odd vertices. We show that the logarithm of the number of balanced independent sets in $Q_d$ is \[(1-\Theta(1/\sqrt d))N/2.\] The key ingredient of the proof is an improved version of "Sapozhenko's graph container lemma".
DOI :
10.37236/10471
Classification :
05C69
Mots-clés : Sapozhenko's graph container lemma, \(d\)-dimensional Hamming cube
Mots-clés : Sapozhenko's graph container lemma, \(d\)-dimensional Hamming cube
Affiliations des auteurs :
Jinyoung Park  1
@article{10_37236_10471,
author = {Jinyoung Park},
title = {Note on the number of balanced independent sets in the {Hamming} cube},
journal = {The electronic journal of combinatorics},
year = {2022},
volume = {29},
number = {2},
doi = {10.37236/10471},
zbl = {1491.05145},
url = {http://geodesic.mathdoc.fr/articles/10.37236/10471/}
}
Jinyoung Park. Note on the number of balanced independent sets in the Hamming cube. The electronic journal of combinatorics, Tome 29 (2022) no. 2. doi: 10.37236/10471
Cité par Sources :