Rigidity and reconstruction for graphs (Q2327716)

Summary: The edge reconstruction conjecture of \textit{F. Harary} [in: Theory Graphs Appl., Proc. Symp. Smolenice 1963, 47--52 (1964; Zbl 0161.43404)] states that a finite graph \(G\) can be reconstructed up to isomorphism from the multiset of its edge-deleted subgraphs \(G-e\) (with \(e\) running over the edges of \(G)\). We put this conjecture in the framework of measure-theoretic rigidity, revealing the importance of the lengths of labeled closed walks for the problem.