✦ LIBER ✦

Some lower bounds of the Ramsey numbers n(k, k)

✍ Scribed by James P Burling; Steven W Reyner

Book ID: 107883996
Publisher: Elsevier Science
Year: 1972
Tongue: English
Weight: 65 KB
Volume: 13
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(72)90051-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

New lower bounds of some diagonal Ramsey

New lower bounds of some diagonal Ramsey numbers

✍ Filip Guldan; Pavel Tomasta 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 122 KB 👁 1 views

A new construction of self-complementary graphs containing no Klo or K , is described. This construction gives the Ramsey number lower bounds r(10,lO) 2 458 and r(1 1,l 1 ) 2 542. The problem of determining the Ramsey numbers is known to be very difficult and so we are often satisfied with partial

A class of self-complementary graphs and

A class of self-complementary graphs and lower bounds of some ramsey numbers

✍ C. R. J. Clapham 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 119 KB 👁 1 views

## Abstract A method is described of constructing a class of self‐complementary graphs, that includes a self‐complementary graph, containing no __K__~5~, with 41 vertices and a self‐complementary graph, containing no __K__~7~, with 113 vertices. The latter construction gives the improved Ramsey num

Lower bounds on the minus domination and

Lower bounds on the minus domination and k-subdomination numbers

✍ Liying Kang; Hong Qiao; Erfang Shan; Dingzhu Du 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 118 KB

A three-valued function f deÿned on the vertex set of a graph G = (V; E), f : V → {-1; 0; 1} is a minus dominating function if the sum of its function values over any closed neighborhood is at least one. That is, for every consists of v and all vertices adjacent to v. The weight of a minus function

An upper bound on the Ramsey numbers R(3

An upper bound on the Ramsey numbers R(3, k)

✍ Jerrold R Griggs 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 372 KB

An upper bound for the ramsey number r(K

An upper bound for the ramsey number r(K5 − e)

✍ H. Harborth; I. Mengersen 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 151 KB 👁 1 views

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