English

Counting Various Classes of Tournament Score Sequences

Combinatorics 2023-06-12 v3

Abstract

Based on known methods for computing the number of distinct score sequences for nn-vertex tournaments, we develop algorithms for computing the number of distinct score sequences for self-complementary tournaments, strong tournaments, and tournaments that are both self-complementary and strong.

Keywords

Cite

@article{arxiv.2202.05238,
  title  = {Counting Various Classes of Tournament Score Sequences},
  author = {Paul K. Stockmeyer},
  journal= {arXiv preprint arXiv:2202.05238},
  year   = {2023}
}

Comments

9 pages

R2 v1 2026-06-24T09:30:49.998Z