Some Ramsey-type theorems
✍ Scribed by Paul Erdős; Fred Galvin
- Publisher
- Elsevier Science
- Year
- 1991
- Tongue
- English
- Weight
- 637 KB
- Volume
- 87
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
We shall prove that for any spatial graph H, there exists a pair of natural numbers (N, M) such that any spatial embedding of the complete bipartite graph K N, M whose projection is a good drawing on the plane contains a subgraph which is ambient isotopic to a subdivision of H. ## 1998 Academic Pre
## 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
In this note we shall prove a geometric Ramsey theorem. Let T be a triangle with angles 30, 60 and 90 degrees, and with hypotenus of unit length. Then the theorem says that if one threecolors the 3-space, then there is always a copy of T with monochromatic vertices. We shall also show that there is