Almost all Tournaments are Irreducible
Canadian mathematical bulletin, Tome 5 (1962) no. 1, pp. 61-65
Voir la notice de l'article provenant de la source Cambridge
Given a set of n points, with each pair of distinct points joined by a line that is oriented towards exactly one of the points, then the resulting configuration is called a (roun-drobin) tournament. A tournament is reducible if the points can be separated into two non-empty subsets, A and B, such that every line that joins a point in A to a point in B is oriented towards the point in B. If a tournament is not reducible it is called irreducible. The object of this note is to derive an approximation for P(n), the probability that a tournament on n point, chosen at random from the set of possible ones, will be irreducible. p(1)=1, by definition.
Moon, J. W.; Moser, L. Almost all Tournaments are Irreducible. Canadian mathematical bulletin, Tome 5 (1962) no. 1, pp. 61-65. doi: 10.4153/CMB-1962-010-4
@article{10_4153_CMB_1962_010_4,
author = {Moon, J. W. and Moser, L.},
title = {Almost all {Tournaments} are {Irreducible}},
journal = {Canadian mathematical bulletin},
pages = {61--65},
year = {1962},
volume = {5},
number = {1},
doi = {10.4153/CMB-1962-010-4},
url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1962-010-4/}
}
Cité par Sources :