A bound for the number of tournaments with specified scores

DOI10.1016/0095-8956(84)90030-3MaRDI QIDQ794663zbMATH OpenOpenAlexFDO

Authors Peter 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

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

Recommendations

• On the number of tournaments with prescribed score vector
• On score sets for tournaments
• scientific article; zbMATH DE number 1829620
• On Reid conjecture of score sets for tournaments
• On score vectors and connectivity of tournaments

Cited in

(7)

• The number of tournaments with the minimum number of upsets
• On the number of tournaments with prescribed score vector
• On Reid conjecture of score sets for tournaments
• The interchange graphs of tournaments with minimum score vectors are exactly hypercubes
• On a conjecture of Brualdi and Shen on block transitive tournaments
• Integral matrices with given row and column sums
• scientific article; zbMATH DE number 4139477 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q794663)