Triple systems with no six points carrying three triangles¶
Ruzsa, I. Z., & Szemeredi, E. Triple systems with no six points carrying three triangles.
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
- If \(f(n)\) denotes that maximum, the fundamental result is that \(f(n)=o(n^2)\), while constructions make \(f(n)\) only a slowly growing factor below quadratic
This sourceCombinatorics (Proc. Fifth Hungarian Colloq., Keszthely, 1976), Vol. II; Colloquia Mathematica Societatis Janos Bolyai 18; North-Holland, Amsterdam-New York, 1978. The originating paper, which proves the (6,3)-theorem f(n) = o(n^2) and gives the Behrend-derived construction placing f(n) only a slowly growing factor below quadratic. The source of the n^2/exp(O(sqrt(log n))) construction whose growth rate this sentence characterises; the comparison with n^(2-epsilon) is elementary asymptotics.
SupportedVerified against the source
- If \(f(n)\) denotes that maximum, the fundamental result is that \(f(n)=o(n^2)\), while constructions make \(f(n)\) only a slowly growing factor below quadratic
Verification¶
Does it exist? Not checked yet. This entry carries no identifier to resolve. It was extracted from the citation as written in the article, normalized, and deduplicated against the rest of the registry.
Does it back the claim? Read against the text for 1 of 1 citation: 1 supported. 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:78398a17191c · see in the full table