Reconstruction conjecture
= Reconstruction conjecture
{wiki=Reconstruction_conjecture}
The Reconstruction Conjecture is a concept in the field of graph theory, specifically related to the properties of graphs. It posits that a simple graph (i.e., a graph without loops or multiple edges) can be uniquely determined (reconstructed) from the collection of its vertex-deleted subgraphs.