Symmetric Hypergraph Theorem
CHF 56.75
Auf Lager
SKU
1SLUN2MP13K
1 Verfügbar
Geliefert zwischen Do., 25.09.2025 und Fr., 26.09.2025
Details
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. The Symmetric hypergraph theorem is a theorem in combinatorics that puts an upper bound on the chromatic number of a graph (or hypergraph in general). The original reference for this paper is unknown at the moment, and has been called folklore.A group G acting on a set S is called transitive if given any two elements x and y in S, there exists an element f of G such that f(x) = y. A graph (or hypergraph) is called symmetric if it''s automorphism group is transitive.This theorem has applications to Ramsey theory, specifically graph Ramsey theory. Using this theorem, a relationship between the graph Ramsey numbers and the extremal numbers can be shown (see Graham-Rothschild-Spencer for the details).
30 Tage Rückgaberecht
GarantieWeitere Informationen
- Allgemeine Informationen
- GTIN 09786131235986
- Editor Lambert M. Surhone, Mariam T. Tennoe, Susan F. Henssonow
- Größe H220mm x B220mm
- EAN 9786131235986
- Format Fachbuch
- Titel Symmetric Hypergraph Theorem
- Herausgeber Betascript Publishing
- Anzahl Seiten 140
- Genre Mathematik
Bewertungen
Schreiben Sie eine Bewertung
