Optimally ranking unrankable tournaments

DOI10.1007/BF02017965zbMath0349.05011MaRDI QIDQ1234694

J. H. Spencer

Publication date: 1980

Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)

zbMATH Keywords

rankingtournaments

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial probability (60C05)

Related Items (12)

The reversing number of a digraph ⋮ On cutting-plane proofs in combinatorial optimization ⋮ Extremal results on feedback arc sets in digraphs ⋮ Invertibility of Digraphs and Tournaments ⋮ Paths with many shortcuts in tournaments ⋮ Intersections of random hypergraphs and tournaments ⋮ A fast and effective heuristic for the feedback arc set problem ⋮ Unnamed Item ⋮ On explicit random-like tournaments ⋮ The number of tournaments with the minimum number of upsets ⋮ A constructive solution to a problem of ranking tournaments ⋮ On the maximum cardinality of a consistent set of arcs in a random tournament

Cites Work

• On Sets of Consistent Arcs in a Tournament
• Optimal ranking of tournaments
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations

This page was built for publication: Optimally ranking unrankable tournaments