{"schema":"vela.problem-packet.v0.1","problem":117,"statement":"Let $h(n)$ be minimal such that any group $G$ with the property that any subset of $>n$ elements contains some $x\\neq y$ such that $xy=yx$ can be covered by at most $h(n)$ many Abelian subgroups.Estimate $h(n)$ as well as possible.","status":"open","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)"}