Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Abstract   Let  G  be a graph with  m  edges and  n  vertices.  show that if 2  m − k  > n ! or if 2 m >( 2   n  ) +  k  then  G  is determined by its collection of  k -edge deleted subgraphs.
['Chris D. Godsil', 'Ilia Krasikov', 'Yehuda Roditty']
I am writing a research paper on a idea Reconstructing graphs from their k -edge deleted subgraphs
[{"from": "human", "value": "I am writing a research paper on a idea Reconstructing graphs from their k -edge deleted subgraphs"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Abstract   Let  G  be a graph with  m  edges and  n  vertices.  show that if 2  m \u2212 k  > n ! or if 2 m >( 2   n  ) +  k  then  G  is determined by its collection of  k -edge deleted subgraphs."}]