{"schema":"vela.problem-packet.v0.1","problem":191,"statement":"Let $C>0$ be arbitrary. Is it true that, if $n$ is sufficiently large depending on $C$, then in any $2$-colouring of $\\binom{\\{2,\\ldots,n\\}}{2}$ there exists some $X\\subseteq \\{2,\\ldots,n\\}$ such that $\\binom{X}{2}$ is monochromatic and\\[\\sum_{x\\in X}\\frac{1}{\\log x}\\geq C?\\]","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)"}