20% off all books with the code: BOOKS
  • check 10+ million books
  • check New arrivals every day
  • check Trusted by 1M+ customers
  • check Great prices & discounts
  • check Shipping across Europe

Turáns Theorem: Complete Graph, Graph (Mathematics) -

English
2026-03-19
€133.57 €166.96

-20% with code BOOKS

In stock at our supplier

Shipping in 15-21 days

30-day return policy

High Quality Content by WIKIPEDIA articles! In graph theory, Turán's theorem is a result on the number of edges in a Kr+1-free graph. An n-vertex graph that does not contain any (r + 1)-vertex clique may be formed by partitioning the set of vertices into r parts of equal or nearly-equal size, and connecting two vertices by an edge whenever they belong to two different parts. We call the resulting graph the ... Full description

You May Also Like

Description

High Quality Content by WIKIPEDIA articles! In graph theory, Turán's theorem is a result on the number of edges in a Kr+1-free graph. An n-vertex graph that does not contain any (r + 1)-vertex clique may be formed by partitioning the set of vertices into r parts of equal or nearly-equal size, and connecting two vertices by an edge whenever they belong to two different parts. We call the resulting graph the Turán graph T(n,r). Turán's theorem states that the Turán graph has the largest number of edges among all Kr+1-free n-vertex graphs. Turán graphs were first described and studied by Hungarian mathematician Paul Turán in 1941, though a special case of the theorem was stated earlier by Mantel in 1907.

More Information

Publisher OmniScriptum
Release year 2026
Cover type Softcover
EAN 9786131142888
Write Your Own Review
You're reviewing: Turáns Theorem: Complete Graph, Graph (Mathematics)
Your Rating:

Goodreads Reviews

€133.57 €166.96