Fourier analysis and large independent sets in powers of complete graphs

Simple item page
dc.creatorGhandehari, Mahya
dc.creatorHatami, Hamed
dc.date2006-12-14
dc.date.accessioned2026-07-07T06:44:41Z
dc.date.available2026-07-07T06:44:41Z
dc.descriptionFor 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$.
dc.identifierhttps://arxiv.org/abs/math/0612377
dc.identifierhttp://arxiv.org/abs/math/0612377
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/102859
dc.subjectCombinatorics
dc.subjectFunctional Analysis
dc.subject06E30; 60B15
dc.titleFourier analysis and large independent sets in powers of complete graphs
dc.typetext

Files

Collections

arXiv