Fourier analysis and large independent sets in powers of complete graphs
Combinatorics
2007-05-23 v1 Functional Analysis
Abstract
For constant and arbitrary , it was known that in the graph any independent set of size close to the maximum is close to some independent set of maximum size. We prove that this statement holds for arbitrary and .
Cite
@article{arxiv.math/0612377,
title = {Fourier analysis and large independent sets in powers of complete graphs},
author = {Mahya Ghandehari and Hamed Hatami},
journal= {arXiv preprint arXiv:math/0612377},
year = {2007}
}