Some basic observations on Kelly's conjecture for graphs

P.J. Kelly first mentioned the possibility of determining a graph from subgraphs obtained by deleting several points. While such problems have received a great deal of attention in the case of deletions of single points, the problem for several points is virtually untouched. This paper contains some basic results on that problem, including the negative observation that for every k, there exist two non-isomorphic graphs with the same collection of k-point subgraphs.