An improved upper bound for Ramsey number \(R(3,3,3,3;2)\) (Q1893181): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0012-365x(93)e0187-9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2016086178 / rank | |||
Normal rank | |||
Latest revision as of 11:01, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An improved upper bound for Ramsey number \(R(3,3,3,3;2)\) |
scientific article |
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
