Counting tournament score sequences

DOI10.1090/proc/16425zbMath1517.05078arXiv2209.03925OpenAlexW4318828914MaRDI QIDQ6106038

Sigurdur Örn Stefánsson, Atli Fannar Franklín, Mark Dukes, Anders Claesson

Publication date: 27 June 2023

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2209.03925

zbMATH Keywords

quadratic time algorithm for counting score sequences

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Enumeration in graph theory (05C30) Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

Permutations with few inversions ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Forests and score vectors
• The On-Line Encyclopedia of Integer Sequences
• Decompositions of Rational Convex Polytopes
• The Theory of Round Robin Tournaments
• The number of score sequences in tournaments
• Erratum
• Computation of the Number of Score Sequences in Round-Robin Tournaments

This page was built for publication: Counting tournament score sequences