A Ramsey theorem for countable homogeneous directed graphs
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}\).
scientific article; zbMATH DE number 1792441