The counting series for unlabeled linear acyclic hypergraphs. (Q5492616)
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 5064066
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The counting series for unlabeled linear acyclic hypergraphs. |
scientific article; zbMATH DE number 5064066 |
Statements
16 October 2006
0 references
hypergraph
0 references
linear hypergraph
0 references
hypertree
0 references
bipartite tree
0 references
Pólya's enumeration theorem
0 references
0.8457980155944824
0 references
0.8109865784645081
0 references
0.8074645400047302
0 references
0.8053671717643738
0 references
0.803288996219635
0 references
