Almost Every n-Vertex Graph is Determined by Its 3log2n-Vertex Subgraphs (Q5859639)
From MaRDI portal
scientific article; zbMATH DE number 7334816
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Almost Every n-Vertex Graph is Determined by Its 3log2n-Vertex Subgraphs |
scientific article; zbMATH DE number 7334816 |
Statements
Almost Every n-Vertex Graph is Determined by Its 3log2n-Vertex Subgraphs (English)
0 references
19 April 2021
0 references
random graph
0 references
graph isomorphism
0 references
unique subgraph
0 references
graph reconstruction
0 references
graph asymmetry
0 references
