Sós–Turán theorem
E2058769
UNEXPLORED
The Sós–Turán theorem is a result in extremal graph theory that gives bounds on the number of edges a graph can have without containing certain subgraphs, extending classical Turán-type results.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Sós–Turán theorem canonical | 1 |
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.