An improved upper bound for Ramsey number \(R(3,3,3,3;2)\) (Q1893181): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On the Ramsey numbers N(3,3,\dots ,3;2) / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Notes on the Ramsey number N(3,3,3,3) / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Combinatorial Relations and Chromatic Graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4161339 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the maximal triangle-free edge-chromatic graphs in three colors / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Ramsey number N(3,3,3,3;2) / rank | |||
Normal rank | |||
Revision as of 14:09, 23 May 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
