Enumeration of regular multipartite hypergraphs

DOI10.1137/25M1733872MaRDI QIDQ7395815zbMATH OpenFDO

Authors M. I. Isaev, Tamás Makai, Brendan D. McKay

Publication date 2026

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/25M1733872

Mathematics Subject Classification ID

Asymptotic enumeration (05A16) Enumeration in graph theory (05C30) Hypergraphs (05C65) Contingency tables (62H17)

Cites work

• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• An Isserlis' theorem for mixed Gaussian variables: Application to the auto-bispectral density
• Asymptotic enumeration of dense 0-1 matrices with equal row sums and equal column sums
• Asymptotic enumeration of digraphs and bipartite graphs by degree sequence
• Asymptotic enumeration of sparse 0--1 matrices with irregular row and column sums
• Complex martingales and asymptotic enumeration
• scientific article; zbMATH DE number 3878944 (Why is no real title available?)
• scientific article; zbMATH DE number 1342092 (Why is no real title available?)
• scientific article; zbMATH DE number 3435482 (Why is no real title available?)

This page was built for publication: Enumeration of regular multipartite hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7395815)