Embedding tournaments in simple tournaments

A tournament is simple if the corresponding relational system is simple in the algebraic sense. It is shown that any tournament T"n with n nodes can be embedded in a simple tournament T"n"+"1 apart from two exceptional types of tournaments which can be embedded in a simple tournament T"n"+"2.