# Counting Various Classes of Tournament Score Sequences

Source: [Counting Various Classes of Tournament Score Sequences](<https://www.sota2.com/research/paper/68fa5a7f1e209131ce9c053d>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-25T16:32:45.557Z

Authors: Paul K. Stockmeyer

Published: 2022-02-10T18:47:38.000Z

## Abstract

Based on known methods for computing the number of distinct score sequences for $n$-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.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/2202.05238>)

[PDF](<https://arxiv.org/pdf/2202.05238.pdf>)
