The number of irreducible tournaments

DOI10.1017/S0017089500000914zbMath0209.03801MaRDI QIDQ5609419

E. M. Wright

Publication date: 1970

Published in: Glasgow Mathematical Journal (Search for Journal in Brave)

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Related Items

Diagram monoids and Graham-Houghton graphs: idempotents and generating sets of ideals ⋮ Finite groups defined by presentations in which each defining relator involves exactly two generators ⋮ IDEMPOTENT RANK IN THE ENDOMORPHISM MONOID OF A NONUNIFORM PARTITION ⋮ Idempotent Generation in the Endomorphism Monoid of a Uniform Partition ⋮ Structural aspects of semigroups based on digraphs

Cites Work

• Theorems on linear combinatorial topology and general measure
• Almost all Tournaments are Irreducible