Enumeration of regular multipartite hypergraphs
Mikhail Isaev, Tam\'as Makai, Brendan D. McKay
TL;DR
This paper provides an asymptotic enumeration of regular multipartite hypergraphs, also known as multidimensional binary contingency tables, for all parameter values, advancing understanding of their combinatorial structure.
Contribution
It offers the first comprehensive asymptotic enumeration formula for regular multipartite hypergraphs across all parameter ranges.
Findings
Derived asymptotic counts for regular multipartite hypergraphs.
Unified enumeration formula applicable to all parameter values.
Enhanced understanding of the combinatorial complexity of these hypergraphs.
Abstract
We determine the asymptotic number of regular multipartite hypergraphs, also known as multidimensional binary contingency tables, for all values of the parameters.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Graph theory and applications · Limits and Structures in Graph Theory