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

Upper bound for the number of perfect (n,3)-codes

โœ Scribed by Alexander Sapozhenko

Book ID
119236644
Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
170 KB
Volume
38
Category
Article
ISSN
1571-0653

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An Upper Bound for the Turรกn Number t3(n
An Upper Bound for the Turรกn Number t3(n, 4)
โœ Fan Chung; Linyuan Lu ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 117 KB

Let t r (n, r+1) denote the smallest integer m such that every r-uniform hypergraph on n vertices with m+1 edges must contain a complete graph on r+1 vertices. In this paper, we prove that lim 3+-17 12 =0.593592... .

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.