论文信息 - The edge reconstruction hypothesis is true for graphs with more than n · log2n edges - 字舞流文

The edge reconstruction hypothesis is true for graphs with more than n · log2n edges

Abstract It is shown that a graph with n vertices and more than n · log 2 n edges can be uniquely reconstructed from its edge-deleted subgraphs.

Vladimír Müller | V. Müller

[1] L. Lovász. A note on the line reconstruction problem , 1972 .

[2] S. Ulam. A collection of mathematical problems , 1960 .

[3] P. Kelly. A congruence theorem for trees. , 1957 .