A bound for the number of tournaments with specified scores

DOI10.1016/0095-8956(84)90030-3zbMath0541.05031OpenAlexW1980752991MaRDI QIDQ794663

Peter M. Gibson

Publication date: 1984

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(84)90030-3

zbMATH Keywords

tournamentsscore vectorstrongly connected

Mathematics Subject Classification ID

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

Related Items (3)

On the number of tournaments with prescribed score vector ⋮ Integral matrices with given row and column sums ⋮ The interchange graphs of tournaments with minimum score vectors are exactly hypercubes

Cites Work

• Unnamed Item

This page was built for publication: A bound for the number of tournaments with specified scores