Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  show that for every @e>0, there exists n"0=n"0(@e) such that for every n>n"0, two n-vertex graphs G"1 and G"2 with e(G"1)e(G"2)=<(1-@e)n^2 pack, unless they belong to a ll-defined family of exceptions. This extends a ll-known result by Sauer and Spencer.
['Alexandr V. Kostochka', 'Gexin Yu']
I am writing a research paper on a idea Packing of graphs with small product of sizes
[{"from": "human", "value": "I am writing a research paper on a idea Packing of graphs with small product of sizes"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  show that for every @e>0, there exists n\"0=n\"0(@e) such that for every n>n\"0, two n-vertex graphs G\"1 and G\"2 with e(G\"1)e(G\"2)=<(1-@e)n^2 pack, unless they belong to a ll-defined family of exceptions. This extends a ll-known result by Sauer and Spencer."}]