Abstract
The Reconstruction Conjecture of Ulam asserts that, for , every -vertex graph is determined by the multiset of its induced subgraphs with 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 there exists (with ) such that when every -vertex graph is determined by the multiset of its induced subgraphs with vertices.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.