Title of article
An improved upper bound for Ramsey number N (3, 3, 3, 3; 2)
Author/Authors
Adolfo Sanchez-Flores، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1994
Pages
6
From page
281
To page
286
Abstract
The Ramsey number N(3,3,3,3; 2) is the smallest integer n such that each 4-coloring by edges of the complete graph on n vertices contains monochromatic triangles. It is well known that 51 ≤ N(3, 3, 3, 3; 2) ≤ 65. Here we prove that N(3, 3, 3, 3; 2) ≤ 64.
Journal title
Discrete Mathematics
Serial Year
1994
Journal title
Discrete Mathematics
Record number
943559
Link To Document