FINITE INDUCED GRAPH RAMSEY THEORY - ON PARTITIONS OF SUBGRAPHS

被引：0
|
作者：
GUNDERSON, DS
RODL, V
SAUER, NW
机构：
[1] EMORY UNIV, ATLANTA, GA 30322 USA
[2] UNIV CALGARY, CALGARY T2N 1N4, AB, CANADA
来源：
JOURNAL OF COMBINATORIAL THEORY SERIES B | 1993年 / 59卷 / 02期
关键词：
D O I：
10.1006/jctb.1993.1066
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
For given finite (unordered) graphs G and H, we examine the existence of a Ramsey graph F for which the strong Ramsey arrow F → (G)Hr 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 → (G)P2 (P2 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 by Academic Press, Inc.
引用
收藏
页码：199 / 209
页数：11
相关论文
共 50 条
12345