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.
Supported in partVerified against the source
- The \((6,3)\) case is a particular extremal triple-system problem with a celebrated resolution at the \(o(n^2)\) level
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 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:52a1605ef58b · see in the full table