At any stage, let G be the underlying graph of the union of the rounds already held. In order for the tournament to continue, the complement of G must contain a 1-factor; in other words, the set of factors chosen so far must not be premature (see ). In practice a limit of approximately log2 n rounds is used for n teams.
|Original language||English (US)|
|Title of host publication||Handbook of Combinatorial Designs, Second Edition|
|Number of pages||16|
|State||Published - Jan 1 2006|