Abstract
The Reconstruction Conjecture of Ulam asserts that, for $n\geq 3$ , every $n$ -vertex graph is determined by the multiset of its induced subgraphs with $n-1$ vertices. The conjecture is known to hold for various special classes of graphs but remains wide open. We survey results on the more general conjecture by Kelly from 1957 that for every positive integer $\ell $ there exists $M_\ell $ (with $M_{1}=3$ ) such that when $n\geq M_\ell $ every $n$ -vertex graph is determined by the multiset of its induced subgraphs with $n-\ell $ vertices.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.