The Ramsey number \(r(C_ 4,C_ 4,C_ 4)\) (Q1078198)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The Ramsey number \(r(C_ 4,C_ 4,C_ 4)\) |
scientific article; zbMATH DE number 3959475
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Ramsey number \(r(C_ 4,C_ 4,C_ 4)\) |
scientific article; zbMATH DE number 3959475 |
Statements
The Ramsey number \(r(C_ 4,C_ 4,C_ 4)\) (English)
0 references
1987
0 references
To establish that \(r(C_ 4,C_ 4,C_ 4)\geq 11\), a coloring of the edges of \(K_{10}\) with 3 colors and no monochrome \(C_ 4\) must be given. This note gives such a coloring with the additional property that the graphs formed by the edges of each color are isomorphic.
0 references
Ramsey number
0 references
edge colouring
0 references
