Honors Graph Theory: definitions and theorems

Babai, L. (2021). Honors Graph Theory: definitions and theorems: definitions and theorems. University of Chicago.

Type

Web resource

Intellectual base

Web

Year

2021

Link

https://people.cs.uchicago.edu/~laci/21graphs/hw.html

Cited by

1 citation across 1 artifact.

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.

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:3cb77b0f25c0 · see in the full table