Enumeration of regular multipartite hypergraphs
Preprint
Abstract
We determine the asymptotic number of regular multipartite hypergraphs, also known as multidimensional binary contingency tables, for all values of the parameters.Keywords
All Related Versions
This publication has 5 references indexed in Scilit:
- Asymptotic enumeration of digraphs and bipartite graphs by degree sequenceRandom Structures & Algorithms, 2022
- An Isserlis’ Theorem for Mixed Gaussian Variables: Application to the Auto-Bispectral DensityJournal of Statistical Physics, 2009
- Asymptotic enumeration of sparse 0–1 matrices with irregular row and column sumsJournal of Combinatorial Theory, Series A, 2006
- Asymptotic Enumeration of Dense 0-1 Matrices with Equal Row Sums and Equal Column SumsThe Electronic Journal of Combinatorics, 2005
- A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular GraphsEuropean Journal of Combinatorics, 1980