Tournament (graph theory)

A tournament is a directed graph (digraph) obtained by assigning a direction for each edge in an undirected complete graph. That is, it is an orientation of a complete graph, or equivalently a directed graph in which every pair of distinct vertices is connected by a directed edge (often, called an arc) with any one of the two possible orientations.

Many of the important properties of tournaments were first investigated by H. G. Landau in to model dominance relations in flocks of chickens. Current applications of tournaments include the study of voting theory and social choice theory among other things.

The name ''tournament'' originates from such a graph's interpretation as the outcome of a round-robin tournament in which every player encounters every other player exactly once, and in which no draws occur. In the tournament digraph, the vertices correspond to the players. The edge between each pair of players is oriented from the winner to the loser. If player $a$ beats player $b$, then it is said that $a$ ''dominates'' $b$. If every player beats the same number of other players (''indegree'' = ''outdegree''), the tournament is called ''regular''.

Paths and cycles

Another basic result on tournaments is that every strongly connected tournament has a Hamiltonian cycle. More strongly, every strongly connected tournament is vertex pancyclic: for each vertex $v$, and each $k$ in the range from three to the number of vertices in the tournament, there is a cycle of length $k$ containing $v$. A tournament $T$is $k$-strongly connected if for every set $U$ of $k-1$ vertices of $T$, $T-U$ is strongly connected.
If the tournament is 4‑strongly connected, then each pair of vertices can be connected with a Hamiltonian path. For every set $B$ of at most $k-1$ arcs of a $k$-strongly connected tournament $T$, we have that $T-B$ has a Hamiltonian cycle. This result was extended by .

Transitivity

A tournament in which $((a \rightarrow b)$ and $(b \rightarrow c))$ $\Rightarrow$ $(a \rightarrow c)$ is called transitive. In other words, in a transitive tournament, the vertices may be (strictly) totally ordered by the edge relation, and the edge relation is the same as reachability.

Equivalent conditions

The following statements are equivalent for a tournament $T$ on $n$ vertices:

# $T$ is transitive.
# $T$ is a strict total ordering.
# $T$ is acyclic.
# $T$ does not contain a cycle of length 3.
# The score sequence (set of outdegrees) of $T$ is $\$.
# $T$ has exactly one Hamiltonian path.

Ramsey theory

Transitive tournaments play a role in Ramsey theory analogous to that of cliques in undirected graphs. In particular, every tournament on $n$ vertices contains a transitive subtournament on $1+\lfloor\log_2 n\rfloor$ vertices. The proof is simple: choose any one vertex $v$ to be part of this subtournament, and form the rest of the subtournament recursively on either the set of incoming neighbors of $v$ or the set of outgoing neighbors of $v$, whichever is larger. For instance, every tournament on seven vertices contains a three-vertex transitive subtournament; the Paley tournament on seven vertices shows that this is the most that can be guaranteed . However, showed that this bound is not tight for some larger values of $n$.

proved that there are tournaments on $n$ vertices without a transitive subtournament of size $2+2\lfloor\log_2 n\rfloor$ Their proof uses a counting argument: the number of ways that a $k$-element transitive tournament can occur as a subtournament of a larger tournament on $n$ labeled vertices is

:$\binomk!2^,$

and when $k$ is larger than $2+2\lfloor\log_2 n\rfloor$, this number is too small to allow for an occurrence of a transitive tournament within each of the $2^$ different tournaments on the same set of $n$ labeled vertices.

Paradoxical tournaments

A player who wins all games would naturally be the tournament's winner. However, as the existence of non-transitive tournaments shows, there may not be such a player. A tournament for which every player loses at least one game is called a 1-paradoxical tournament. More generally, a tournament $T=(V,E)$ is called $k$-paradoxical if for every $k$-element subset $S$ of $V$ there is a vertex $v_0$ in $V\setminus S$ such that $v_0 \rightarrow v$ for all $v \in S$. By means of the probabilistic method, Paul Erdős showed that for any fixed value of $k$, if $, V, \geq k^22^k\ln(2+o(1))$, then almost every tournament on $V$ is $k$-paradoxical. On the other hand, an easy argument shows that any $k$-paradoxical tournament must have at least $2^-1$ players, which was improved to $(k+2)2^-1$ by Esther and George Szekeres (1965). There is an explicit construction of $k$-paradoxical tournaments with $k^24^(1+o(1))$ players by Graham and Spencer (1971) namely the Paley tournament.

Condensation

The condensation of any tournament is itself a transitive tournament. Thus, even for tournaments that are not transitive, the strongly connected components of the tournament may be totally ordered.

Score sequences and score sets

The score sequence of a tournament is the nondecreasing sequence of outdegrees of the vertices of a tournament. The score set of a tournament is the set of integers that are the outdegrees of vertices in that tournament.

Landau's Theorem (1953) A nondecreasing sequence of integers $(s_1, s_2, \ldots, s_n)$ is a score sequence if and only if :
# $0 \le s_1 \le s_2 \le \cdots \le s_n$
# $s_1 + s_2 + \cdots + s_i \ge , \texti = 1, 2, \ldots, n - 1$
# $s_1 + s_2 + \cdots + s_n = .$

Let $s(n)$ be the number of different score sequences of size $n$. The sequence $s(n)$ starts as:

1, 1, 1, 2, 4, 9, 22, 59, 167, 490, 1486, 4639, 14805, 48107, ...

Winston and Kleitman proved that for sufficiently large ''n'':
:$s(n) > c_1 4^n n^,$
where $c_1 = 0.049.$
Takács later showed, using some reasonable but unproven assumptions, that
:$s(n) < c_2 4^n n^,$
where $c_2 < 4.858.$

Together these provide evidence that:
:$s(n) \in \Theta (4^n n^).$

Here $\Theta$ signifies an asymptotically tight bound.

Yao showed that every nonempty set of nonnegative integers is the score set for some tournament.

Majority relations

In social choice theory, tournaments naturally arise as majority relations of preference profiles.Brandt, Felix and Brill, Markus and Harrenstein, Paul,
"Tournament Solutions". Chapter 3 in:
Let $A$ be a finite set of alternatives, and consider a list $P = (\succ_1, \dots, \succ_n)$ of linear orders over $A$. We interpret each order $\succ_i$ as the preference ranking of a voter $i$. The (strict) majority relation $\succ_$ of $P$ over $A$ is then defined so that $a \succ_ b$ if and only if a majority of the voters prefer $a$ to $b$, that is $, \, > , \,$. If the number $n$ of voters is odd, then the majority relation forms the dominance relation of a tournament on vertex set $A$.

By a lemma of McGarvey, every tournament on $m$ vertices can be obtained as the majority relation of at most $m(m-1)$ voters. Results by Stearns and Erdős & Moser later established that $\Theta(m/\log m)$ voters are needed to induce every tournament on $m$ vertices.

Laslier (1997) studies in what sense a set of vertices can be called the set of "winners" of a tournament. This revealed to be useful in Political Science to study, in formal models of political economy, what can be the outcome of a democratic process.Austen-Smith, D. and J. Banks, Positive Political theory, 1999, The University of Michigan Press.

See also

* Oriented graph
* Paley tournament
* Sumner's conjecture
* Tournament solution

Notes

References

*.
*.
* .
*.
*.
*.
*.
*.
*
* .
*.
*.
* .
* .
*.
*.
* .
* .

{{DEFAULTSORT:Tournament (Graph Theory)
Directed graphs