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.
- 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¶
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:78398a17191c · see in the full table