A note on the cardinality of certain classes of unlabeled multipartite tournaments

DOI10.1016/S0012-365X(98)00013-2zbMath0956.05057OpenAlexW2045951882MaRDI QIDQ1584288

Gregory Gutin

Publication date: 2 November 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(98)00013-2

zbMATH Keywords

enumerationorientationmultipartite tournamentbipartite tournaments

Mathematics Subject Classification ID

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

Related Items (4)

The shifted Turán sieve method on tournaments. II ⋮ Multipartite tournaments: a survey ⋮ On \(n\)-partite tournaments with unique \(n\)-cycle ⋮ Acyclic Digraphs

Cites Work

• Unnamed Item
• On 4‐cycles in random bipartite tournaments
• Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a survey
• Elementary proof of a counting formula for acyclic bipartite tournaments

This page was built for publication: A note on the cardinality of certain classes of unlabeled multipartite tournaments