🎴 Flashcard Mode
Extremal Graph Theory
Card1 / 14
Mastered0
Review0
QuestionClick to flip
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?
AnswerClick to flip back
A
n(n-1)/2 - r(r-1)/2
💡 Explanation:
Turán's Theorem states that the maximum number of edges in a graph on n vertices that does not contain a complete subgraph of order r is n(n-1)/2 - r(r-1)/2.