Indivisible homogeneous directed graphs and a game for vertex partitions Original Research Article

Let image be a set of finite tournaments. We will give a necessary and sufficient condition for the image-free homogeneous directed graph image to be divisible; that is, that there is a partition of image into two sets neither of which contains an isomorphic copy of image.