arXivDaily arXiv每日学术速递 周一至周五更新
arXiv math/0612377math.COmath.FA
收藏

Fourier analysis and large independent sets in powers of complete graphs

Mahya Ghandehari, Hamed Hatami

英文摘要:

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$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑