✦ LIBER ✦

On a generalization of Ramsey theory

✍ Scribed by Michael S. Jacobson

Publisher: Elsevier Science
Year: 1982
Tongue: English
Weight: 485 KB
Volume: 38
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(82)90288-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On a generalization of Ramsey numbers

✍ Paul Erdös; Patrik E. O'neil 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 685 KB

## Given the integers I, , k, , I, , k, , r , which satisfy the condition I,, I, >r> k,, k, > 0, we define m = N(Z,, k,;l,, k,;r) as the smallest integer with the following property: ifS is a set containing IS? points and the r-subsets of S are partitioned arbitrarily into two class~:s,

On Generalized Ramsey Theory: The Bipart

On Generalized Ramsey Theory: The Bipartite Case

✍ Maria Axenovich; Zoltán Füredi; Dhruv Mubayi 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 208 KB

A generalization of a Ramsey-type theore

A generalization of a Ramsey-type theorem on hypermatchings

✍ Paul Baginski 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 93 KB

## Abstract For an __r__‐uniform hypergraph __G__ define __N__(__G__, __l__; 2) (__N__(__G__, __l__; ℤ~__n__~)) as the smallest integer for which there exists an __r__‐uniform hypergraph __H__ on __N__(__G__, __l__; 2) (__N__(__G__,__l__; ℤ~__n__~)) vertices with clique(__H__) < __l__ such that eve

Generalized Ramsey theory for graphs IV,

Generalized Ramsey theory for graphs IV, the Ramsey multiplicity of a graph

✍ F. Harary; G. Prins 📂 Article 📅 1974 🏛 John Wiley and Sons 🌐 English ⚖ 412 KB

A paopm graph G has no isolated points. I t s R m e y r u m b a r ( G ) i s the m i n i m p such that every 2-coloring of the edges of K contains a monochromatic G. The Ramhey m & t @ m y R(G) i s P the r (G) ' With j u s t one exception, namely Kq, we determine R(G) f o r proper graphs u i t h a t

On the use of senders in generalized ram

On the use of senders in generalized ramsey theory for graphs

✍ Stefan A Burr; Jaroslav Nešetřil; Vojtech Rödl 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 910 KB

If F, G, and H are graphs, write F ~ (G,/-/) to mean that however the edges of F are colored red and blue, either the red (partial) subgraph contains a copy of G or the blue subgraph contains a copy of H. Many interesting questions exist concerning this relation, particularly involving the case in w

Generalized ramsey theory for graphs VII

Generalized ramsey theory for graphs VII: Ramsey numbers for multigraphs and networks

✍ F. Harary; A. J. Schwenk 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 309 KB