A counterexample to a conjecture of Schwartz
- 334 Downloads
In 1990, motivated by applications in the social sciences, Thomas Schwartz made a conjecture about tournaments which would have had numerous attractive consequences. In particular, it implied that there is no tournament with a partition A, B of its vertex set, such that every transitive subset of A is in the out-neighbour set of some vertex in B, and vice versa. But in fact there is such a tournament, as we show in this article, and so Schwartz’ conjecture is false. Our proof is non-constructive and uses the probabilistic method.
Unable to display preview. Download preview PDF.
- Brandt F, Brill M, Fischer F, Harrenstein P (2011) Minimal retentive sets in tournaments. Soc Choice Welf (in press)Google Scholar
- Erdős P, Moser L (1964) On the representation of directed graphs as unions of orderings. Publ Math Inst Hung Acad Sci 9: 125–132Google Scholar
- Laffond G, Laslier J-F, Le Breton M (1993) More on the tournament equilibrium set. Math Sci Hum 123: 37–44Google Scholar