{"schema":"vela.problem-packet.v0.1","problem":426,"statement":"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?","status":"solved","seam":"raw","closureRoutes":[],"obligations":[],"attestations":[],"attempts":[],"velaLean":[],"oeis":[],"generated_note":"derived view; the signed event log is the source of truth (vela check / vela reproduce)"}