A Harary-Sachs theorem for hypergraphs (Q2033904)
From MaRDI portal
!
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 7360913
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Harary-Sachs theorem for hypergraphs |
scientific article; zbMATH DE number 7360913 |
Statements
A Harary-Sachs theorem for hypergraphs (English)
0 references
18 June 2021
0 references
characteristic polynomial
0 references
hypergraph
0 references
subgraph statistics
0 references
0.9479796290397644
0 references
0.759110152721405
0 references
0.7519931197166443
0 references
0.7482808828353882
0 references
