✦ LIBER ✦
Finite Induced Graph Ramsey Theory: On Partitions of Subgraphs
✍ Scribed by D.S. Gunderson; V. Rodl; N.W. Sauer
- Publisher
- Elsevier Science
- Year
- 1993
- Tongue
- English
- Weight
- 425 KB
- Volume
- 59
- Category
- Article
- ISSN
- 0095-8956
No coin nor oath required. For personal study only.
✦ Synopsis
For given finite (unordered) graphs (G) and (H), we examine the existence of a Ramsey graph (F) for which the strong Ramsey arrow (F \rightarrow(G){r}^{\prime \prime}) holds. We concentrate on the situation when (H) is not a complete graph. The set of graphs (G) for which there exists an (F) satisfying (F \rightarrow(G){2}^{P_{2}}\left(P_{2}\right.) is a path on three vertices) is found to be the union of the set of chordal comparability graphs together with the set of convex graphs. 1993 Academic Press, Inc.