Enumeration of dihypergraphs with specified degrees and edge types
Enumeration of dihypergraphs with specified degrees and edge types
A dihypergraph consists of a set of vertices and a set of directed hyperedges, where each directed hyperedge is partitioned into a head and a tail. Directed hypergraphs are useful in many applications, including the study of chemical reactions or relational databases. We provide asymptotic formulae for the number of …