{"schema":"vela.problem-packet.v0.1","problem":746,"statement":"Is it true that, almost surely, a random graph on $n$ vertices with $\\geq (\\tfrac{1}{2}+\\epsilon)n\\log n$ edges is Hamiltonian?","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)"}