Almost all Tournaments are Irreducible

DOI10.4153/CMB-1962-010-4zbMATH Open0105.33304MaRDI QIDQ3290976FDOQ3290976

Authors: J. W. Moon, Leo Moser 

Publication date: 1962

Published in: Canadian Mathematical Bulletin (Search for Journal in Brave)

zbMATH Keywords

probability theory

Cited In (13)

• Robust bounds on choosing from large tournaments
• On the likelihood of cyclic comparisons
• The localization game on oriented graphs
• Intransitive dice
• A note on hypertournaments
• Properties of almost all graphs and complexes
• Robust bounds on choosing from large tournaments
• On the evolution of a random tournament
• Finite groups defined by presentations in which each defining relator involves exactly two generators
• Weakening arcs in tournaments
• Cycles and matchings in randomly perturbed digraphs and hypergraphs
• The number of irreducible tournaments
• Counting acyclic and strong digraphs by descents

This page was built for publication: Almost all Tournaments are Irreducible

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