𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On a Generalized Anti-Ramsey Problem

✍ Scribed by Maria Axenovich; André Kündgen

Publisher
Springer-Verlag
Year
2001
Tongue
English
Weight
224 KB
Volume
21
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On a Ramsey-type problem
On a Ramsey-type problem
✍ F. R. K. Chung 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 212 KB
On a Quasi-Ramsey problem
On a Quasi-Ramsey problem
✍ Paul Erdös; János Pach 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 368 KB

It is proved th2t if a graph G has at least cn log n vertices, then either G or its complement G contains a subgraph H with a t least n vertices and minimum degree a t least 1 V ( H ) I /2. This result is not far from being best possible, as is shown by a rather unusual random construction. Some rel

On a Ramsey-Turán type problem
On a Ramsey-Turán type problem
✍ Béla Bollobás; Paul Erdös 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 128 KB
On a generalization of Ramsey numbers
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,