Algebraic Graph Theory Seminar

Title: Graph Reconstruction

Abstract: The graph reconstruction conjecture by Kelly and Ulam states that all graphs on at least three vertices are determined by their one-vertex deleted subgraphs, up to isomorphism. It remains an open problem for over half a decade. In this talk, we give an overview of some results related to this conjecture, including the recent result by Farhadian.