An improved upper bound for Ramsey number \(R(3,3,3,3;2)\) (Q1893181)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 769320
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An improved upper bound for Ramsey number \(R(3,3,3,3;2)\) |
scientific article; zbMATH DE number 769320 |
Statements
An improved upper bound for Ramsey number \(R(3,3,3,3;2)\) (English)
0 references
10 March 1996
0 references
The author shows that any 4-colouring of the edges of \(K_{65}\) must contain a monochromatic triangle. Thus \(R(3,3,3,3; 2)\leq 64\). (The previous upper bound was 65.) It is known that \(R(3,3,3,3; 2)\geq 51\); that is, \(K_{50}\) can be 4-coloured with no monochromatic triangle.
0 references
Ramsey number
0 references
4-colouring
0 references
monochromatic triangle
0 references
0.94537485
0 references
0.9334675
0 references
0.92513657
0 references
0.91747755
0 references
0.9110548
0 references
0.90569603
0 references
