Counting Various Classes of Tournament Score Sequences
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.