The edge reconstruction hypothesis is true for graphs with more than \(n\cdot \log_2\,n\) edges (Q1222665)
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: The edge reconstruction hypothesis is true for graphs with more than \(n\cdot \log_2\,n\) edges |
scientific article; zbMATH DE number 3499811
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The edge reconstruction hypothesis is true for graphs with more than \(n\cdot \log_2\,n\) edges |
scientific article; zbMATH DE number 3499811 |
Statements
The edge reconstruction hypothesis is true for graphs with more than \(n\cdot \log_2\,n\) edges (English)
0 references
1977
0 references
