Some extremal problems on r-graphs¶
Brown, W. G., Erdos, & Sos, V. T. Some extremal problems on r-graphs. New Directions in the Theory of Graphs (Proc. Third Ann Arbor Conf., Univ. Michigan, Ann Arbor, Mich., 1971).
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
- The \((6,3)\) case is a particular extremal triple-system problem with a celebrated resolution at the \(o(n^2)\) level
This sourceNew Directions in the Theory of Graphs (Proc. Third Ann Arbor Conf., Univ. Michigan, Ann Arbor, Mich., 1971), Academic Press, New York, 1973. The Brown-Erdos-Sos paper that poses the general extremal problem on r-graphs and conjectures the o(n^2) bound for every (e+3, e) configuration, of which (6,3) is the first non-trivial case; the resolution of that case is Ruzsa-Szemeredi 1978.
- The \((6,3)\) case is a particular extremal triple-system problem with a celebrated resolution at the \(o(n^2)\) level
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:52a1605ef58b · see in the full table