On the number of tournaments with prescribed score vector

DOI10.1016/0012-365X(86)90092-0zbMath0594.05035OpenAlexW2045069244MaRDI QIDQ1076686

Wan Honghui, Li Qiao

Publication date: 1986

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(86)90092-0

zbMATH Keywords

score vectorstournament matrices

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

On nearly self-conjugate partitions of a finite set ⋮ Algorithms for computing lengths of chains in integral partition lattices.

Cites Work

• A bound for the number of tournaments with specified scores
• The class A(R,S) of (0,1)-matrices
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the number of tournaments with prescribed score vector