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.
Supported in partVerified against the source
- Behrend-type sets supply lower-bound constructions, but the Ruzsa–Szemerédi object is a graph or triple system and requires a conversion
Verification¶
Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.
Does it back the claim? Read against the text for 1 of 1 citation: 1 supported in part. Each verdict is shown under its citation below, with what in the work backs the sentence.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:025cbdc64f56 · see in the full table