Round robin tournaments are omnipresent in sport competitions and beyond. We investigate three integer programming formulations for scheduling a round tournament, one of which we call the matching formulation. analytically compare their linear relaxations, find that relaxation formulation is stronger than other while still being solvable polynomial time. In addition, provide an exponentially si...