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 n2 2-cn 3 2 unique subgraphs is proven for c > 3 2 √2 and n sufficiently large.
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics