The number of bipartite tournaments with a unique given factor

DOI10.1002/JGT.3190130311MaRDI QIDQ3835482zbMATH OpenOpenAlexFDO

Authors Manoussakis Manolis, Manoussakis Yannis

Publication date 1989

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

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

zbMATH Keywords

bipartite tournamentsenumeration of graphslinear recurrence formulaunique factor

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• scientific article; zbMATH DE number 54800
• scientific article; zbMATH DE number 4195996
• On \(n\)-partite tournaments with unique \(n\)-cycle
• Cycles and paths in bipartite tournaments with spanning configurations
• A note on the cardinality of certain classes of unlabeled multipartite tournaments

Cited in

(1)

• Elementary proof of a counting formula for acyclic bipartite tournaments

This page was built for publication: The number of bipartite tournaments with a unique given factor

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