{"schema":"vela.problem-packet.v0.1","problem":1098,"statement":"Let $G$ be a group and $\\Gamma=\\Gamma(G)$ be the non-commuting graph, with vertices the elements of $G$ and an edge between $g$ and $h$ if and only if $g$ and $h$ do not commute, $gh\\neq hg$.If $\\Gamma$ contains no infinite complete subgraph, then is there a finite bound on the size of complete subgraphs of $\\Gamma$?","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)"}