You’re only 3 weeks away from a new language
Lead AI-Native Products with Microsoft's Agentic AI Program
Overview
Google, IBM & Meta Certificates — All 10,000+ Courses at 40% Off
One annual plan covers every course and certificate on Coursera. 40% off for a limited time.
Get Full Access
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.
Syllabus
Intro to Graphs
Investigation Begins
Recognizing Size
Recognizing Degree
Finding the Suspect
A Stronger Reconstruction Conjecture
Reconstructable Families
Taught by
Wrath of Math