Extremal Graph Theory

Casual Mode - Take your time!

1 / 14
✓
Correct
0
✗
Incorrect
0
★
Score
0%
Multiple Choice

In Turán's Theorem, what is the maximum number of edges in a graph on n vertices that does not contain a complete subgraph of order r?

  1. n(n-1)/2
  2. n(n-1)/2 - r(r-1)/2
  3. n(n-1)/2 + r(r-1)/2
  4. n(n-1)/2 - r(r+1)/2
Change Mode