2-Partition-Transitive Tournaments

Abstract

Given a tournament score sequence s1 s2 sn , we prove that there exists a tournament T on vertex set f1; 2; : : : ; ng such that the degree of any vertex i is s i and the subtournaments of T on both the even and the odd vertices are transitive in the given order. This means that i beats j whenever i < j and i j (mod 2). For an