{"schema":"vela.problem-packet.v0.1","problem":915,"statement":"Let $G$ be a graph with $1+n(m-1)$ vertices and $1+n\\binom{m}{2}$ edges. Must $G$ contain two points which are connected by $m$ disjoint paths?","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)"}