๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An improved sphere covering bound for the codes with n=3 R+2

โœ Scribed by Hou, X.-D.

Book ID
114540697
Publisher
IEEE
Year
1990
Tongue
English
Weight
244 KB
Volume
36
Category
Article
ISSN
0018-9448

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An improved upper bound for Ramsey numbe
An improved upper bound for Ramsey number N (3, 3, 3, 3; 2)
โœ Adolfo Sanchez-Flores ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 251 KB

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.