Szemerédi's theorem

E959796 UNEXPLORED

Szemerédi's theorem is a fundamental result in combinatorial number theory stating that any subset of the integers with positive upper density contains arbitrarily long arithmetic progressions.

Try in SPARQL Jump to: Referenced by

Referenced by (3)

Full triples — surface form annotated when it differs from this entity's canonical label.

Green–Tao theorem → generalizesFrom → Szemerédi's theorem ⓘ

Green–Tao theorem → inspiredBy → Szemerédi's theorem ⓘ

Green–Tao theorem → relatedTo → Szemerédi's theorem ⓘ