Enumeration of regular multipartite hypergraphs

2025/02/12 by Isaev, Mikhail, Makai, Tamás, McKay, Brendan D.
#05A16 #05C65 #62H17 #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.2502.08046

Abstract

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

Related

• Enumeration of dihypergraphs with specified degrees and edge types
• Asymptotic Enumeration of Binary Contingency Tables and Comparison with Independence Heuristic
• A Short Note on Asymptotic Enumeration of Contingency Tables with Non-Uniform Margins
• Asymptotic enumeration of sparse uniform linear hypergraphs with given degrees
• The number of regular simplices in higher dimensions