✦ LIBER ✦

Some results on Ramsey numbers using sumfree sets

✍ Scribed by Samira Y. Kettoola; J.D. Roberts

Publisher: Elsevier Science
Year: 1982
Tongue: English
Weight: 157 KB
Volume: 40
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(82)90194-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A result on C4-star Ramsey numbers

✍ Guantao Chen 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 140 KB

In this paper, we will show that the Ramsey number r(C4,Ki,n+l)<~r(C4,Ki,n)+ 2 for all positive integers n. This result answers a question proposed by Burr, Erd6s, Faudree, Rousseau, and Schelp.

A note on upper bounds for some Ramsey n

A note on upper bounds for some Ramsey numbers

✍ Chiê Nara; Shun-ichi Tachibana 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 345 KB

We show that r(3, n) C(Z) -5 for n 2 13, and r(4, n)So(l') -1 for n 3 12.

Some results on the achromatic number

✍ Cairnie, Niall; Edwards, Keith 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 106 KB

Let G be a simple graph. The achromatic number ψ(G) is the largest number of colors possible in a proper vertex coloring of G in which each pair of colors is adjacent somewhere in G. For any positive integer m, let q(m) be the largest integer k such that ( k 2 ) ≤ m. We show that the problem of dete

Some observations on NP real numbers and

Some observations on NP real numbers and P-selective sets

✍ Alan L. Selman 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 353 KB

Some results on the complexity of famili

Some results on the complexity of families of sets

✍ Daniel Grieser 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 872 KB

Grieser, D., Some results on the complexity of families of sets, Discrete Mathematics 88 (1991) 179-192. Let 'Y be a property of graphs on a fixed n-element vertex set V. The complexity c(P) is the minimal number of edges whose existence in a previously unknown graph H has to be tested such that it

Some results on the existence of large s

Some results on the existence of large sets of t-designs

✍ G. B. Khosrovshahi; R. Tayfeh-Rezaie 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 96 KB 👁 1 views

## Abstract A set of trivial necessary conditions for the existence of a large set of __t__‐designs, __LS__[N](__t,k,__ν), is $N\big | {{\nu \hskip -3.1 \nu}-i \choose k-i}$ for __i__ = 0,…,__t__. There are two conjectures due to Hartman and Khosrovshahi which state that the trivial necessary condi