Transitive Tournament

Transitivity
A transitive tournament on 8 vertices.
A tournament in which and is called transitive. The

following statements are equivalent for a tournament T on n vertices:
1. T is transitive
2. T is acyclic
3. T does not contain a cycle of length 3
4. The score sequence (set of outdegrees) of T is {0,1,2,...,n − 1}.
5. T has exactly one Hamiltonian path.
Every tournament on n vertices has a transitive subtournament on log2n vertices. Reid and
Parker showed that this bound is not tight. Erdős and Moser have proved that there are
tournaments on n vertices without a transitive subtournament of size 2log2n.
A player who wins all games would naturally be the tournament's winner. However, as the
above example shows, there might 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 v0 in
such that for all . By means of the probabilistic method, Paul Erdős
showed that for any fixed value of k, if |V| ≥ k22kln(2 + o(1)), then almost every tournament
on V is k-paradoxical.[3] On the other hand, an easy argument shows that any k-paradoxical
tournament must have at least 2k+1 − 1 players, which was improved to (k + 2)2k−1 − 1 by
Esther and George Szekeres.[4] There is an explicit construction of k-paradoxical tournaments
with k24k−1(1 + o(1)) players by Graham and Spencer,[5] namely the Paley tournament.
Tournament
An oriented graph (cf. also Graph, oriented) without loops, each pair of vertices of which are
joined by an arc in exactly one direction. A tournament with vertices can be regarded as the
outcome of a competition with players, the rules of which forbid draws. The notion of a
tournament is used for ordering objects by the method of pairwise comparison. In this
connection it finds application in biology, sociology, etc.
A tournament is said to be transitive if its vertices can be indexed by the numbers in

such a way that there is an arc going from to if and only if . There are no circuits in a
transitive tournament. A tournament is said to be strong if for any ordered pair of vertices
there exists a directed path from to . A set of arcs in a tournament is called
compatible if there are no circuits in the subgraph formed by these arcs and the vertices
incident to them. The maximum cardinality of a set of compatible arcs is a measure of
compatibility in the definition of "the winner" of the tournament. Every tournament contains
a subset of compatible arcs of cardinality not less than . Another
measure of compatibility is the ratio of the number of transitive -vertex subtournaments of a
tournament with vertices to the number of strong -vertex subtournaments. The maximum
number of strong -vertex subtournaments of a tournament with vertices is equal to
A tournament is strong if and only if it has a spanning cycle (Hamiltonian circuit). Every
strong tournament with vertices has a circuit of length for . Every tournament
has a spanning path (Hamiltonian path).
The outdegrees of a tournament with vertices satisfy the equation
Suppose that a set of integers satisfies the condition

. Then a tournament with outdegrees exists if and only
if for any the inequality
holds, with equality for . Furthermore, a tournament is strong if and only if

If and are two subtournaments of a tournament and if there exists an arc for
each pair of vertices in and in , then one writes . Suppose that the set of
vertices of a tournament is partitioned into non-intersecting subsets . Suppose
further that either or for . Then the partition defines an
equivalence relation on the vertices of . A tournament is called simple if no non-trivial
equivalence relation can be defined on its vertices. Every tournament with vertices is a
subtournament of some simple tournament with vertices. A tournament with vertices
is a subtournament of some simple tournament with vertices if and only if is neither a
circuit with three vertices nor a non-trivial transitive tournament with an odd number of
vertices. The number of pairwise non-isomorphic tournaments with vertices is
asymptotically equal to
The number of distinct tournaments with indexed vertices is equal to
The generating functions and for tournaments and strong tournaments, respectively,
are related by the formula:
Every tournament with vertices, , that is not strong is uniquely recoverable from the
family of its -vertex subtournaments.
References
[1] F. Harary, "Graph theory" , Addison-Wesley (1969) pp. Chapt. 9
[2] J.W. Moon, "Topics on tournaments" , Holt, Rinehart & Winston (1968)
A.A. Sapozhenko
Comments
A random tournament over is defined by making random choices of an arc

or for each pair of different vertices , the choice being equiprobable and
independent for all different pairs. Cf. [2] for many results on random tournaments.
References
[a1] F. Harary, L. Moser, "The theory of round robin tournaments" Amer. Math. Monthly , 73
(1966) pp. 231–246
[a2] L. Comtet, "Advanced combinatorics" , Reidel (1974) pp. 68ff (Translated from French)

Transitive Tournament

Uploaded by

Copyright:

Available Formats

Transitive Tournament

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Transitive Tournament

Uploaded by

Copyright:

Available Formats

Transitivity

A transitive tournament on 8 vertices.

A tournament in which and is called transitive. The

A tournament is said to be transitive if its vertices can be indexed by the numbers in

The outdegrees of a tournament with vertices satisfy the equation

Suppose that a set of integers satisfies the condition

holds, with equality for . Furthermore, a tournament is strong if and only if

The number of distinct tournaments with indexed vertices is equal to

A random tournament over is defined by making random choices of an arc

You might also like

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.