A Ramsey theorem for countable homogeneous directed graphs (Q1613517)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A Ramsey theorem for countable homogeneous directed graphs |
scientific article; zbMATH DE number 1792441
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Ramsey theorem for countable homogeneous directed graphs |
scientific article; zbMATH DE number 1792441 |
Statements
A Ramsey theorem for countable homogeneous directed graphs (English)
0 references
29 August 2002
0 references
Continuing earlier work on the indivisibility of homgeneous graphs, the paper completely describes the vertex partitions of the countable homogeneous directed graph \(H_{\mathcal T}\) which does not embed any of the tournaments in a finite set of finite tournaments \({\mathcal T}\).
0 references
homogeneous graph
0 references
tournament
0 references
vertex partition
0 references
0 references
0.9008527
0 references
0.89234674
0 references
0.8918219
0 references
0 references
0.88851315
0 references
0 references
0.88558936
0 references
