Almost every \(n\)-vertex graph is determined by its \(3 \log_2n\)-vertex subgraphs (Q5859639)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Almost every n-vertex graph is determined by its 3 _2n-vertex subgraphs |
scientific article; zbMATH DE number 7334816
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Almost every \(n\)-vertex graph is determined by its \(3 \log_2n\)-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
0.8033784031867981
0 references
0.7731660604476929
0 references
0.7690005302429199
0 references
