The invariant theory of the graph reconstruction conjecture.

A "card" of an unlabelled graph is the subgraph obtained by deleting one vertex. The multiset of all such cards forms a graph's "deck". Kelly and Ulam proposed the Graph Reconstruction Conjecture, which asks if one can determine a graph from its deck (up to isomorphism). We approach this conjecture from an invariant theory perspective.