This paper proves that almost every [Formula: see text]-vertex graph has the property that the multiset of its induced subgraphs on [Formula: see text] vertices is sufficient to determine it up to isomorphism. That is, the probability that there exists two [Formula: see text]-vertex graphs with the same multiset of [Formula: see text]-vertex induced subgraphs goes to zero as [Formula: see text] goes to infinity.

中文翻译：

---

几乎每个 n 顶点图都由它的 3log2n 顶点子图决定

这篇论文证明了几乎每一个[公式：见正文]-顶点图都具有这样的性质，即其在[公式：见正文]顶点上的诱导子图的多重集足以将其确定为同构。也就是说，当[公式：参见文本]趋于无穷大时，存在两个具有相同多重[公式：参见文本]-顶点诱导子图的[公式：参见文本]-顶点图的概率变为零。