1 Answers
The reconstruction conjecture of Stanisław Ulam is one of the best-known open problems in graph theory. Using the terminology of Frank Harary it can be stated as follows: If G and H are two graphs on at least three vertices and ƒ is a bijection from V to V such that G\{v} and H\{ƒ} are isomorphic for all vertices v in V, then G and H are isomorphic.
4 views
Answered