✦ LIBER ✦

On zero sum Ramsey numbers: Multiple copies of a graph

✍ Scribed by A. Bialostocki; P. Dierker

Publisher: John Wiley and Sons
Year: 1994
Tongue: English
Weight: 376 KB
Volume: 18
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190180205

No coin nor oath required. For personal study only.

✦ Synopsis

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 combined into a single theorem. Another consequence is the determination of zero sum Ramsey numbers of multiple copies of some small graphs.

📜 SIMILAR VOLUMES

Ramsey numbers for multiple copies of co

Ramsey numbers for multiple copies of complete graphs

✍ P. J. Lorimer; R. J. Segedin 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 107 KB 👁 1 views

Zero-sum delta-systems and multiple copi

Zero-sum delta-systems and multiple copies of graphs

✍ Caro, Yair; Provstgaard, Christian 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 268 KB 👁 1 views

A main result proved in this paper is the following. Theorem. Let G be a noncomplete graph on n vertices with degree sequence where R is the zero-sum Ramsey number.

On zero-sum delta-systems and multiple c

On zero-sum delta-systems and multiple copies of hypergraphs

✍ Yair Caro 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 492 KB 👁 1 views

## Abstract We prove the following generalization of earlier results of Bialostocki and Dierker [3] and Caro [7]. Theorem. Let __t__ ⩾ __k__ ⩾ 2 be positive integers such that __k__ | __t__, and let __c :E__(K) → ℤ~__k__~ be a mapping of all the __r__‐subsets of an __rt__ + __k__ −1 element set in

Bounds on chromatic numbers of multiple

Bounds on chromatic numbers of multiple factors of a complete graph

✍ Ján Plesník 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 306 KB 👁 1 views

## Abstract Bounds on the sum and product of the chromatic numbers of __n__ factors of a complete graph of order __p__ are shown to exist. The well‐known theorem of Nordhaus and Gaddum solves the problem for __n__ = 2. Strict lower and some upper bounds for any __n__ and strict upper bounds for __n