Almost all Tournaments are Irreducible
From MaRDI portal
Publication:3290976
DOI10.4153/CMB-1962-010-4zbMath0105.33304MaRDI QIDQ3290976
Publication date: 1962
Published in: Canadian Mathematical Bulletin (Search for Journal in Brave)
Related Items (13)
On the evolution of a random tournament ⋮ The number of irreducible tournaments ⋮ Properties of almost all graphs and complexes ⋮ The localization game on oriented graphs ⋮ Counting acyclic and strong digraphs by descents ⋮ Finite groups defined by presentations in which each defining relator involves exactly two generators ⋮ Cycles and Matchings in Randomly Perturbed Digraphs and Hypergraphs ⋮ A note on hypertournaments ⋮ On the likelihood of cyclic comparisons ⋮ Intransitive Dice ⋮ Robust bounds on choosing from large tournaments ⋮ Weakening arcs in tournaments ⋮ Robust bounds on choosing from large tournaments
This page was built for publication: Almost all Tournaments are Irreducible
