The former three theorems generalise to oriented graphs with independence number bounded by some fixed constant.
Furthermore, the tournaments (or oriented graphs with bounded independence)
can be augmented by any fixed number of arbitrary binary relations:
the results still hold for the resulting class of binary relational structures.
In particular, this work generalises the analogous results of [1]}
on ordered graphs and ordered binary structures: we replace linear orders with tournaments.
In these generalisations, however, the classes of obstructions for thm:obstructions
are more numerous and far more tedious to describe.
