A note on non-reconstructible 3-hypergraphs (Q343751)
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 6657156
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on non-reconstructible 3-hypergraphs |
scientific article; zbMATH DE number 6657156 |
Statements
A note on non-reconstructible 3-hypergraphs (English)
0 references
29 November 2016
0 references
hypergraph
0 references
Ulam's problem
0 references
graph reconstruction
0 references
subgraph counting
0 references
pseudo-similarity
0 references
0 references
0.8888547420501709
0 references
0.8816260695457458
0 references
0.7587214708328247
0 references
0.7586894035339355
0 references
0.756894052028656
0 references
