Fourier analysis and large independent sets in powers of complete graphs
Abstract
For constant r and arbitrary n, it was known that in the graph Krn 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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.