Brendan D. McKay

Asymptotic enumeration of constrained bipartite, directed and oriented graphs by degree sequence

In the sufficiently sparse case, we find the probability that a uniformly random bipartite graph with given degree sequence contains no edge from a specified set of edges. This enables us to enumerate loop-free digraphs and oriented graphs with given in-degree and out-degree sequ...

Enumeration of Regular Multipartite Hypergraphs

Abstract. We determine the asymptotic number of regular multipartite hypergraphs, also known as multidimensional binary contingency tables, for all values of the parameters.