The Unsolved Problem of Reconstruction in Graph Theory

Explore a 21-minute mathematical video delving into one of graph theory's most significant unsolved problems - the reconstruction conjecture proposed by Paul Kelly and Stanislaw Ulam in 1941. Learn how to analyze a deck of cards containing vertex deleted subgraphs to reconstruct a mystery graph, while discovering the intricacies of this mathematical puzzle. Progress through key concepts including graph introduction, size recognition, degree analysis, and suspect identification, before examining a stronger version of the reconstruction conjecture and exploring reconstructable families. Master fundamental graph theory concepts through this engaging investigation that combines theoretical mathematics with practical problem-solving approaches.