On the number of unique subgraphs of a graph

R. C. Entringer, Paul Erdös

Research output: Contribution to journalArticle

4 Citations (Scopus)


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.

Original languageEnglish
Pages (from-to)112-115
Number of pages4
JournalJournal of Combinatorial Theory, Series B
Issue number2
Publication statusPublished - Oct 1972


ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics

Cite this