𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the Erdős-Ginzburg-Ziv theorem and the Ramsey numbers for stars and matchings

✍ Scribed by A. Bialostocki; P. Dierker

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
511 KB
Volume
110
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On Four Colored Sets with Nondecreasing
On Four Colored Sets with Nondecreasing Diameter and the Erdős–Ginzburg–Ziv Theorem
✍ David J. Grynkiewicz 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 197 KB

A set X; with a coloring D: X ! Z m ; is zero-sum if P x2X DðxÞ ¼ 0: Let f ðm; rÞ (let f zs ðm; 2rÞ) be the least N such that for every coloring of 1; . . . ; N with r colors (with elements from r disjoint copies of Z m ) there exist monochromatic (zero-sum) m-element subsets B 1 and B 2 ; not neces

A constructive approach for the lower bo
A constructive approach for the lower bounds on the Ramsey numbers R (s, t)
✍ Xu Xiaodong; Xie Zheng; Stanisław P. Radziszowski 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 89 KB 👁 1 views

## Abstract Graph __G__ is a (__k__, __p__)‐graph if __G__ does not contain a complete graph on __k__ vertices __K__~__k__~, nor an independent set of order __p__. Given a (__k__, __p__)‐graph __G__ and a (__k__, __q__)‐graph __H__, such that __G__ and __H__ contain an induced subgraph isomorphic t