{"schema":"vela.problem-packet.v0.1","problem":666,"statement":"Let $Q_n$ be the $n$-dimensional hypercube graph (so that $Q_n$ has $2^n$ vertices and $n2^{n-1}$ edges). Is it true that, for every $\\epsilon>0$, if $n$ is sufficiently large, every subgraph of $Q_n$ with\\[\\geq \\epsilon n2^{n-1}\\]many edges contains a $C_6$?","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)"}