Erdős problem 426

We say $H$ is a unique subgraph of $G$ if there is exactly one way to find $H$ as a subgraph (not necessarily induced) of $G$. Is there a graph on $n$ vertices with $$\gg \frac{2^{\binom{n}{2}}}{n!}$$ many distinct unique subgraphs?