✦ LIBER ✦

A complete characterization of the zero-sum (mod 2) ramsey numbers

✍ Scribed by Yair Caro

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 299 KB
Volume: 68
Category: Article
ISSN: 0097-3165
DOI: 10.1016/0097-3165(94)90098-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The characterization of zero-sum (mod 2)

The characterization of zero-sum (mod 2) bipartite Ramsey numbers

✍ Caro, Yair; Yuster, Raphael 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 134 KB

Let G be a bipartite graph, with k|e(G). The zero-sum bipartite Ramsey number B(G, Z k ) is the smallest integer t such that in every Z k -coloring of the edges of K t,t , there is a zero-sum mod k copy of G in K t,t . In this article we give the first proof that determines B(G, Z 2 ) for all possib

On zero sum Ramsey numbers: Multiple cop

On zero sum Ramsey numbers: Multiple copies of a graph

✍ A. Bialostocki; P. Dierker 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 376 KB 👁 1 views

## Abstract As a consequence of our main result, a theorem of Schrijver and Seymour that determines the zero sum Ramsey numbers for the family of all __r__‐hypertrees on __m__ edges and a theorem of Bialostocki and Dierker that determines the zero sum Ramsey numbers for __r__‐hypermatchings are com

The size Ramsey number of a complete bip

The size Ramsey number of a complete bipartite graph

✍ P. Erdo˝s; C.C. Rousseau 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 240 KB

Erd6s. P. and C.C. Rousseau, The size Ramsey number of a complete bipartite graph, Discrete Mathematics 113 (1993) 259-262. In this note we prove that the (diagonal) size Ramsey number of K,,.,, is bounded below by $2'2".

A characterization of the value of zero-

A characterization of the value of zero-sum two-person games

✍ S. H. Tijs 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 193 KB

The Ramsey number for a cycle of length

The Ramsey number for a cycle of length five vs. a complete graph of order six

✍ Chula J. Jayawardene; Cecil C. Rousseau 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 147 KB 👁 1 views

Approximating the Number of Zeroes of a

Approximating the Number of Zeroes of a GF[2] Polynomial

✍ M. Karpinski; M. Luby 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 325 KB

We develop a probabilistic polynomial time algorithm which on input a polynomial $g\left(x_{1}, \ldots, x_{n}\right)$ over $G F[2], \epsilon$ and $\delta$, outputs an approximation to the number of zeroes of $g$ with relative error at most $\epsilon$ with probability at least $1-\delta$.