From Narsingh Deo, Graph Theory -> A round-robin tournament (when every player plays against every other) among n players (n being an even number) can be represented by a complete graph of n vertices. Discuss how you would schedule the tournaments to finish in the shortest possible time.