On the number of unique subgraphs of a graph (Q5921501)
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: On the number of unique subgraphs of a graph |
scientific article; zbMATH DE number 3380652
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the number of unique subgraphs of a graph |
scientific article; zbMATH DE number 3380652 |
Statements
On the number of unique subgraphs of a graph (English)
0 references
1972
0 references
A subgraph \(H\) of a graph \(G\) is unique if \(H\) is not isomorphic to any other subgraph of \(G\). The existence of a graph on \(n\) vertices having at least \(2^{n^2/2-cn^{3/2}}\) unique subgraphs is proven for \(c>{3 \over 2} \sqrt 2\) and \(n\) sufficiently large.
0 references
