The counting series for unlabeled true strict \((d)\)-connected acyclic hypergraphs (Q3054112)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 5811140
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The counting series for unlabeled true strict \((d)\)-connected acyclic hypergraphs |
scientific article; zbMATH DE number 5811140 |
Statements
5 November 2010
0 references
hypergraph
0 references
hypertree
0 references
Pólya enumeration theorem
0 references
0.8342863321304321
0 references
0.8074645400047302
0 references
0.7909359931945801
0 references
0.7787216901779175
0 references
0.7727150321006775
0 references
