Ramsey type theorems in the plane
✍ Scribed by Rozália Juhász
- Publisher
- Elsevier Science
- Year
- 1979
- Tongue
- English
- Weight
- 431 KB
- Volume
- 27
- Category
- Article
- ISSN
- 0097-3165
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
## Abstract Let us call a finite subset __X__ of a Euclidean __m__‐space E^m^ __Ramsey__ if for any positive integer __r__ there is an integer __n__ = __n__(__X;r__) such that in any partition of E^n^ into __r__ classes __C__~1~,…, __C~r~__, some __C~i~__ contains a set __X__' which is the image of