A Ramsey-type theorem and its application to relatives of Helly's theorem
✍ Scribed by A. Gyárfás
- Publisher
- Springer Netherlands
- Year
- 1973
- Tongue
- English
- Weight
- 550 KB
- Volume
- 3
- Category
- Article
- ISSN
- 0031-5303
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
A known theorem states that there is a function f = f(k) such that every tournament T with at least f(k) vertices contains a transitive subtournament on k vertices. In this paper, the concept of an ordered r-tournament is introduced and the existence of an analogous function to f = f(k) is establish