𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A New Lower Bound For A Ramsey-Type Problem

✍ Scribed by Benny Sudakov*

Publisher
Springer-Verlag
Year
2005
Tongue
English
Weight
199 KB
Volume
25
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A lower bound for irredundant Ramsey num
A lower bound for irredundant Ramsey numbers
✍ Michael Krivelevich πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 348 KB

Given a graph G-(V,E), a vertex subset U C V is called irredundant if every vertex v E U either has no neighbours in U or there exists a vertex w E V\U such that v is the only neighbour of w in U. The irredundant Ramsey number s(m,n) is the smallest N such that any redblue edge colouring of K N yiel

A lower bound for Ramsey's theorem
A lower bound for Ramsey's theorem
✍ Joram Hirschfeld πŸ“‚ Article πŸ“… 1980 πŸ› Elsevier Science 🌐 English βš– 291 KB

For every integer tz we denote by n the set {O, 1, . . . , n -1). We denote by En]" the collection of subsets of with exactly k elements. We call the elements of [n]" k-tuples and write thein dlown as (a,, . . . , a,) in the natural order: a, < a, c l . l < ak < n. A colouting 04 [nlk by r colours i

A new upper bound for the bipartite Rams
A new upper bound for the bipartite Ramsey problem
✍ David Conlon πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 89 KB πŸ‘ 1 views

## Abstract We consider the following question: how large does __n__ have to be to guarantee that in any two‐coloring of the edges of the complete graph __K__~__n,n__~ there is a monochromatic __K__~__k,k__~? In the late 1970s, Irving showed that it was sufficient, for __k__ large, that __n__ β‰₯ 2^_

A ramsey-type bound for rectangles
A ramsey-type bound for rectangles
✍ TοΏ½th, GοΏ½za πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 199 KB

It is proved that for any rectangle T and for any 2-coloring of the points of the 5dimensional Euclidean space, one can always find a rectangle T' congruent to T , all of whose vertices are of the same color. We also show that for any k-coloring of the k2 + o(k2)-dimensional space, there is a monoch