Search
Close this search box.

Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

Calculating the Frequency of Tournament Score Sequences

Frank Plastria1
1Mosi, Vrije Universiteit Brussel, Pleinlaan 2, 1050 Brussels, Belgium
  • Published: 31/05/2015

Abstract

We indicate how to calculate the number of round-robin tournaments realizing a given score sequence. This is obtained by inductively calculating the number of tournaments realizing a score function. Tables up to 18 participants are obtained.

Keywords: tournament; score sequence. Thanks to Dennis Van Den Broeck for bringing this question to my attention.
Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin
1970-2024 CP (Manitoba, Canada) unless otherwise stated.
Citation
Frank Plastria. Calculating the Frequency of Tournament Score Sequences[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 093. 273-290. DOI: .