Elementary proof of a counting formula for acyclic bipartite tournaments

DOI10.1002/JGT.3190200307zbMath0836.05004OpenAlexW1967392496MaRDI QIDQ4857431

Cecil C. Rousseau

Publication date: 22 April 1996

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190200307

zbMATH Keywords

Stirling numbersbijectionacyclic bipartite tournamentsband permutations

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Partitions of sets (05A18) Permutations, words, matrices (05A05) Enumeration in graph theory (05C30) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

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

This page was built for publication: Elementary proof of a counting formula for acyclic bipartite tournaments