{"schema":"vela.problem-packet.v0.1","problem":76,"statement":"Is it true that in any $2$-colouring of the edges of $K_n$ there must exist at least\\[(1+o(1))\\frac{n^2}{12}\\]many edge-disjoint monochromatic triangles?","status":"solved","seam":"raw","closureRoutes":[],"obligations":[],"attestations":[],"attempts":[],"velaLean":[],"oeis":[{"id":"A060407","name":"Maximal number of pairwise edge-disjoint monochromatic K_3's in a K_n for any 2-coloring of the edges of K_n.","terms":"0,0,0,1,2,2,3,4,6","url":"https://oeis.org/A060407"}],"generated_note":"derived view; the signed event log is the source of truth (vela check / vela reproduce)"}