A Ramsey-Type Theorem for Orderings of a Graph
✍ Scribed by Rödl, Vojtech; Winkler, Peter
- Book ID
- 118197510
- Publisher
- Society for Industrial and Applied Mathematics
- Year
- 1989
- Tongue
- English
- Weight
- 501 KB
- Volume
- 2
- Category
- Article
- ISSN
- 0895-4801
- DOI
- 10.1137/0402035
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
Two configurations (i.e., finite planar point sets) are said to be of the same order type, if there is a bijection between them which preserves orientations of triples of points. We show a Ramsey-type result about order types which yields that any configuration of a proper order type (in general pos