Pith. sign in

REVIEW

Fourier analysis and large independent sets in powers of complete graphs

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv math/0612377 v1 pith:VACEBCXD submitted 2006-12-14 math.CO math.FA

Mahya Ghandehari , Hamed Hatami This is my paper · ORCID
classification math.COmath.FA
keywords independentarbitraryclosemaximumsizeanalysiscompleteconstant
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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$.

Discussion (0). Continue with ORCID to comment.

Pith tools