On Sets of Integers Which Contain No Three Terms in Arithmetical Progression¶
Behrend, F. A. (1946). On Sets of Integers Which Contain No Three Terms in Arithmetical Progression. Proceedings of the National Academy of Sciences.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Domain-specific¶
- Ruzsa–Szemerédi Problem
- Behrend-type sets supply lower-bound constructions, but the Ruzsa–Szemerédi object is a graph or triple system and requires a conversion
This sourceBehrend's construction of dense sets of integers containing no three terms in arithmetic progression, which is the arithmetic input to the lower bound; the conversion into a graph or triple system is Ruzsa-Szemeredi's.
- Behrend-type sets supply lower-bound constructions, but the Ruzsa–Szemerédi object is a graph or triple system and requires a conversion
Verification¶
This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.
Registry ID ref:025cbdc64f56 · see in the full table