Transitive convex subsets in large tournaments
References (4)
- et al.
On convex subsets in tournaments
SIAM J. Alg. Disc. Meth.
(1982) Tournament Solutions and Majority Voting
(1997)
There are more references available in the full text version of this article.
Cited by (1)
The morphology of infinite tournaments; application to the growth of their profile
2010, European Journal of CombinatoricsCitation Excerpt :Find a result, similar to Theorem 2, for indecomposable tournaments and, possibly, a finitary version. The notion of an acyclically indecomposable tournament was studied by Culus and Jouve in [7,8,14]. The notion of a profile was introduced in 1971 by the second author (see [11,12]) and developed in [18–20]; for a survey see [24].
- ⋆
I am grateful to Alain Guénoche for placing his C programs at my disposal.
Copyright © 2005 Elsevier B.V. All rights reserved.