Fourier analysis and large independent sets in powers of complete graphs

Mathematics – Combinatorics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

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

     

Profile ID: LFWR-SCP-O-476901

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.