Almost Every n-Vertex Graph is Determined by Its 3log2n-Vertex Subgraphs

The paper shows that almost every $n$-vertex graph is, uniquely, determined by its subgraphs with $3 \log_2{n}$ vertices. Therefore, for checking the isomorphism of almost every pair of $n$-vertex graphs, it is sufficient to compare their $3 \log_2{n}$-vertex subgraphs.