A bound for the number of tournaments with specified scores

https://doi.org/10.1016/0095-8956(84)90030-3Get rights and content
Under an Elsevier user license
open archive

Abstract

Let T(R) denote the set of all tournaments with score vector R = (r1, r2,…, rn). R. A. Brualdi and Li Qiao (“Proceedings of the Silver Jubilee Conference in Combinatorics at Waterloo,” in press) conjectured that if R is strong with r1r2 ≤ … ≤ rn, then |T(R)| ≥ 2n−2 with equality if and only if R = (1, 1, 2,…, n − 3, n − 2, n − 2). In this paper their conjecture is proved, and this result is used to establish a lower bound on the cardinality of T(R) for every R.

Cited by (0)