On the number of independent sets in extenders
Diskretnaya Matematika, Tome 13 (2001) no. 1, pp. 56-62
Voir la notice de l'article provenant de la source Math-Net.Ru
We improve Alon's upper bound for the number of independent sets in regular graphs and extend it to almost regular graphs. We also present an upper bound for the number of independent sets of non-typical size for almost regular graphs and an upper bound of the form $2^{(n/2)(1-c\delta)}$, where $c$ is a constant, for the number of independent sets in almost regular $\delta$-expanders.
@article{DM_2001_13_1_a1,
author = {A. A. Sapozhenko},
title = {On the number of independent sets in extenders},
journal = {Diskretnaya Matematika},
pages = {56--62},
publisher = {mathdoc},
volume = {13},
number = {1},
year = {2001},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/DM_2001_13_1_a1/}
}
A. A. Sapozhenko. On the number of independent sets in extenders. Diskretnaya Matematika, Tome 13 (2001) no. 1, pp. 56-62. http://geodesic.mathdoc.fr/item/DM_2001_13_1_a1/