A Ramsey theorem for countable homogeneous directed graphs

被引:5
|
作者
Sauer, NW [1 ]
机构
[1] Univ Calgary, Dept Math & Stat, Calgary, AB T2N 1N4, Canada
基金
加拿大自然科学与工程研究理事会;
关键词
D O I
10.1016/S0012-365X(01)00448-4
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Let J be a finite set of finite tournaments and H-J the countable homogeneous directed graph which does not embed any of the tournaments in J. We will completely describe the vertex partition property H-J. (C) 2002 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:45 / 61
页数:17
相关论文
共 50 条