Fourier analysis and large independent sets in powers of complete graphs

Details Fourier analysis and large independent sets in powers of complete graphs Fourier analysis and large independent sets in powers of complete graphs

2006-12-14

arxiv.org/abs/math/0612377v1

Mathematics

Combinatorics

Scientific paper

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

Affiliated with

Also associated with

No associations

Rating

Fourier analysis and large independent sets in powers of complete graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Fourier analysis and large independent sets in powers of complete graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fourier analysis and large independent sets in powers of complete graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-476901