Theorem on Friends and Strangers
CHF 39.85
Auf Lager
SKU
D0DNBPSVDM9
1 Verfügbar 
Kostenloser Versand ab CHF 50
Geliefert zwischen Mi., 15.10.2025 und Do., 16.10.2025
Details
High Quality Content by WIKIPEDIA articles! The theorem on friends and strangers is a mathematical theorem in an area of mathematics called Ramsey theory. A proof of the theorem requires nothing but a three-step logic. It is convenient to phrase the problem in graph-theoretic language. Suppose a graph has 6 vertices and every pair of vertices is joined by an edge. Such a graph is called a complete graph (because there cannot be any more edges). A complete graph on n, vertices is denoted by the symbol Kn,. Now take a K6,. It has 15 edges in all. Let the 6 vertices stand for the 6 people in our party. Let the edges be coloured red or blue depending on whether the two people represented by the vertices connected by the edge are mutual strangers or mutual acquaintances, respectively.
30 Tage Rückgaberecht
GarantieWeitere Informationen
- Allgemeine Informationen
- GTIN 09786131146398
- Editor Lambert M. Surhone, Miriam T. Timpledon, Susan F. Marseken
- EAN 9786131146398
- Format Fachbuch
- Titel Theorem on Friends and Strangers
- Herausgeber Betascript Publishing
- Anzahl Seiten 88
- Genre Mathematik
Bewertungen
Schreiben Sie eine Bewertung
