Fourier analysis and large independent sets in powers of complete graphs
classification
🧮 math.CO
math.FA
keywords
independentarbitraryclosemaximumsizeanalysiscompleteconstant
read the original 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$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.