DIMACS - Graduate Student Combinatorics Seminar

Title: The Graph Reconstruction Conjecture

Speaker: Tim Naumovitz, Rutgers University

Date: Wednesday, October 8, 2014 12:10pm

Location: Graduate Student Lounge, 7th Floor, Hill Center, Rutgers University, Busch Campus, Piscataway, NJ


The Reconstruction Conjecture, a famous open problem in graph theory, asks whether all graphs are uniquely determined by their list of subgraphs of order n-1. In this talk, I will answer this question, and talk about modified versions of this conjecture. I will also give an overview of certain properties of graphs which are known to be reconstructible, as well as certain classes of graphs which can be reconstructed from their subgraphs.

See: http://math.rutgers.edu/~nhf12/GCS/