Fourier analysis and large independent sets in powers of complete graphs

Authors:
Mahya Ghandehari;Hamed Hatami
Affiliations:
Department of Pure Mathematics, University of Waterloo, Canada;Department of Computer Science, University of Toronto, Canada
Venue:
Journal of Combinatorial Theory Series B
Year:
2008

Citing 7
Cited 1

Additive bases of vector spaces over prime fields

Journal of Combinatorial Theory Series A
Constant depth circuits, Fourier transform, and learnability

Journal of the ACM (JACM)
Lower bounds on the competitive ration for mobile user tracking and distributed job scheduling

Theoretical Computer Science - Special issue on dynamic and on-line algorithms
On subsets of finite Abelian groups with no 3-term arithmetic progressions

Journal of Combinatorial Theory Series A
Boolean functions whose Fourier transform is concentrated on the first two levels

Advances in Applied Mathematics
Intersecting families of permutations

European Journal of Combinatorics
Stable sets of maximal size in Kneser-type graphs

European Journal of Combinatorics

Survey: Randomly colouring graphs (a combinatorial view)

Computer Science Review

Quantified Score

Hi-index	0.00

Visualization

Abstract

For constant r and arbitrary n, it was known that in the graph K"r^n 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 r and n.