✦ LIBER ✦

An upper bound for the Folkman number F(3, 3; 5)

✍ Scribed by Martin Erickson

Book ID: 118762810
Publisher: John Wiley and Sons
Year: 1993
Tongue: English
Weight: 134 KB
Volume: 17
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190170604

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.

Upper bounds for ramsey numbers R(3, 3,

Upper bounds for ramsey numbers R(3, 3, ?, 3) and Schur numbers

✍ Wan, Honghui 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 81 KB 👁 2 views

In this paper we show that for n ≥ 4, R(3, 3, . . . , 3) < n!( e-e -1 + 3 2 ) + 1. Consequently, a new bound for Schur numbers is also given. Also, for even n ≥ 6, the Schur number S n is bounded by S n < n!( e-e -1 + 3 2 ) -n + 2.

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 upper bound for the Ramsey numbers r(

An upper bound for the Ramsey numbers r(K3,G)

✍ Wayne Goddard; Daniel J. Kleitman 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 372 KB

The Ramsey number r(H, G) is defined as the minimum N such that for any coloring of the edges of the N-vertex complete graph KN in red and blue, it must contain either a ted H or a blue G. In this paper we show that for any graph G without isolated vertices, r(K,, G)< 2qf 1 where G has q edges. In o

Upper bound for the number of perfect (n

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

✍ Alexander Sapozhenko 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 170 KB

An upper bound for the ramsey number M(5

An upper bound for the ramsey number M(5, 4)

✍ K Walker 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 498 KB