Sie verwenden einen veralteten Webbrowser, weshalb es zu Problemen mit der Darstellung kommen kann. Bei Problemen mit der Bestellabgabe können Sie gerne auch telefonisch bestellen unter: 01805 565554 (0,14€/min, mobil max.0,42€/min)

Turán's Theorem

Autor:	Lambert M. Surhone / Miriam T. Timpledon / Susan F. Marseken
Verfügbarkeit:	Auf Lager.
Artikelnummer:	876773
ISBN / EAN:	9786131142888

Verfügbarkeit: sofort lieferbar

29,00

Inkl. MwSt. , zzgl. Versandkosten

Ihre Kundenmeinung hinzufügen

Produktbeschreibung

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.