On a metric generalization of ramsey’s theorem
✍ Scribed by P. Erdös; A. Hajnal; J. Pach
- Book ID
- 110679503
- Publisher
- The Hebrew University Magnes Press
- Year
- 1997
- Tongue
- English
- Weight
- 515 KB
- Volume
- 102
- Category
- Article
- ISSN
- 0021-2172
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## 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
## 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,