Reconstructing graphs from their k-edge deleted subgraphs (Q1077434)

Let G be a graph with m edges and n vertices. We show that if \(2^{m- k}>n!\) or if \(2m>\left( \begin{matrix} n\\ 2\end{matrix} \right)+k\) then G is determined by its collection of k-edge deleted subgraphs.