Abstract
By a tournament we mean the outcome of a round-robin tournament in which there are no draws. Such a tournament may be represented by a graph in which the n players are represented by vertices labelled 1, 2, …, n, and the outcomes of the games are represented by directed edges so that every pair of vertices is joined by one directed edge. We call such a graph a complete directed graph. One can also represent such a tournament by an nXn matrix T=(tij) in which tij is 1 if i beats j, and 0 otherwise, so that T is a (0, 1) matrix with tij + tji = 1 for i≠j and (by definition) tii = 0.
Publisher
Canadian Mathematical Society
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. χ-bounded families of oriented graphs;Journal of Graph Theory;2018-04-10
2. On a problem of Erdős and Moser;Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg;2017-01-09
3. Large unavoidable subtournaments;Electronic Notes in Discrete Mathematics;2015-11
4. Cycle Transversals in Tournaments with Few Vertex Disjoint Cycles;Journal of Graph Theory;2014-09-10
5. Embedded antichains in tournaments;Electronic Notes in Discrete Mathematics;2002-07