WRSWorld Research StateContribute
WORLD RESEARCH STATE

Erdős and Stone: the structure of linear graphs

Contribution grade

Combinatorics and discrete mathematics · THEOREM

Reference score190,000Provisional editorial estimate of this exact contribution; its grade is assessed separately.

What changed

Established chromatic-number-governed asymptotic forbidden-graph edge density.

Scientific scope

The record is the exact two-author 1946 Bulletin of the American Mathematical Society paper. It does not absorb Turán's complete-graph theorem, later Erdős-Simonovits refinements or finite exact bounds not proved there.

Evidence

The linked sources identify this contribution and its scope. WRS has not independently reconstructed the scientific claims. The record is the exact two-author 1946 Bulletin of the American Mathematical Society paper. It does not absorb Turán's complete-graph theorem, later Erdős-Simonovits refinements or finite exact bounds not proved there.

Contributors

Provisional WRS assessment, edition 2026-10-16.1. Independent expert calibration is pending. This grade does not certify correctness or assign ownership.

Full scientific record · Browse contribution grades · Request a correction