✦ LIBER ✦

An upper bound for sets

✍ Scribed by Gang Yu

Publisher: Elsevier Science
Year: 2007
Tongue: English
Weight: 134 KB
Volume: 122
Category: Article
ISSN: 0022-314X
DOI: 10.1016/j.jnt.2006.04.008

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An Upper-Bound theorem for families of c

An Upper-Bound theorem for families of convex sets

✍ Jürgen Eckhoff 📂 Article 📅 1985 🏛 Springer 🌐 English ⚖ 470 KB

An Upper Bound for the Number of Treatme

An Upper Bound for the Number of Treatments Common to any Set of Blocks of Certain PBIB Designs

✍ S. M. Shah; Dr. D. G. Kabe 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 351 KB 👁 3 views

A New Upper Bound for B2[2] Sets

✍ Alain Plagne 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 94 KB

Constructive Upper Bounds for Intersecti

Constructive Upper Bounds for Intersecting Set Systems

✍ Vince Grolmusz 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 245 KB

An upper bound for ramsey numbers

✍ Yusheng Li; C.C Rousseau; Wenan Zang 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 138 KB

An upper bound for some ramsey numbers

✍ Andrew Thomason 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 307 KB 👁 1 views

New upper bounds for the ramsey numbers r ( k , I ) are obtained. In particular it is shown there is a constant A such that The ramsey number r(k, l ) is the smallest integer n, such that any coloring with red and blue of the edges of the complete graph K , of order n yields either a red K , subgra