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.
Recommendations
Cites work
- Enumeration of hypergraphs. I
- scientific article; zbMATH DE number 3685495 (Why is no real title available?)
- scientific article; zbMATH DE number 3715609 (Why is no real title available?)
- scientific article; zbMATH DE number 43754 (Why is no real title available?)
- scientific article; zbMATH DE number 3268842 (Why is no real title available?)
- scientific article; zbMATH DE number 3419161 (Why is no real title available?)
- On the number of bi-colored graphs
Cited in
(12)- The Euler formula of cyclomatic numbers of hypergraphs
- Counting acyclic hypergraphs
- Enumeration of unlabeled directed hypergraphs
- Enumeration of unlabeled uniform hypergraphs
- scientific article; zbMATH DE number 6490941 (Why is no real title available?)
- On the counting formulas of hypergraphs and hyperblocks
- scientific article; zbMATH DE number 4006293 (Why is no real title available?)
- scientific article; zbMATH DE number 4068909 (Why is no real title available?)
- GENERATING NON-JUMPING NUMBERS OF HYPERGRAPHS
- Enumeration of hypergraphs. I
- Enumeration of hypergraphs. I
- Pólya theory of hypercubes
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)