Enumeration of hypergraphs (Q5942871)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Enumeration of hypergraphs |
scientific article; zbMATH DE number 1643800
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Enumeration of hypergraphs |
scientific article; zbMATH DE number 1643800 |
Statements
Enumeration of hypergraphs (English)
0 references
27 February 2002
0 references
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.
0 references
0.8504654169082642
0 references
0.8435971140861511
0 references
0.8382152318954468
0 references
0.8360790610313416
0 references
