An improved upper bound for Ramsey number N (3, 3, 3, 3; 2) |
| |
| Authors: | Adolfo Sanchez-Flores |
| |
| Institution: | Instituto de Investigaciones en Matemáticas Aplicadas y en Sistemas, Universidad Nacional Autónoma de México, Apartado Postal 20-726, 01000, México, D.F., Mexico |
| |
| 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. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
