Graph Reconstruction Conjecture Department of 图重建猜想.pptVIP

Graph Reconstruction Conjecture Graph Reconstruction Conjecture Proposed by S.M. Ulan P.J. Kelly in 1941: The conjecture states that every graph with at least 3 vertices is reconstructible; a graph G is reconstructible if it is defined by its vertex-deleted subgraphs. Graph Reconstruction Conjecture Every graph with at least three vertices is reconstructible Unproven Verified for regular graphs (graphs in which all vertices have same number of edges). Verified for all graphs with at most 11 vertices. Bollobás: Used probability to show that almost all graphs are reconstructible; probabili