Enumeration of hypergraphs

From MaRDI portal





Formulas for the cycle index of the representation of the symmetric group of degree \(n\) acting on all subsets of the object set are derived and applied through \(n=7\). These can be used to enumerate hypergraphs with Pólya's enumeration theorem. The approach is similar to that of \textit{E. M. Palmer} [Discrete Math. 6, 377-390 (1973; Zbl 0269.05110)] where the focus was on pure hypergraphs.











This page was built for publication: Enumeration of hypergraphs

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