Extremal Graph Theory I¶
Fox, J. Extremal Graph Theory I: Classical Results.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Domain-specific¶
- Turán Graph
- Turán's theorem says more: among every simple graph on (n) vertices with no (K_{r+1}), (T(n,r)) has the largest possible number of edges, and it is the unique maximizer up to graph isomorphism.
This sourceInstitute for Advanced Study lecture notes giving the complete-multipartite reduction, balancing argument, and Turán theorem.
- Turán's theorem says more: among every simple graph on (n) vertices with no (K_{r+1}), (T(n,r)) has the largest possible number of edges, and it is the unique maximizer up to graph isomorphism.
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:c6d3fdcece19 · see in the full table