{"schema":"vela.problem-packet.v0.1","problem":500,"statement":"What is $\\mathrm{ex}_3(n,K_4^3)$? That is, the largest number of $3$-edges which can placed on $n$ vertices so that there exists no $K_4^3$, a set of 4 vertices which is covered by all 4 possible $3$-edges.","status":"open","seam":"raw","closureRoutes":[],"obligations":[],"attestations":[],"attempts":[],"velaLean":[],"oeis":[{"id":"A140462","name":"Turan's upper bound on the number of triangles of a simplicial complex of dimension two for which every minimal non-face has three vertices.","terms":"0,0,0,1,3,7,14,23,36,54,75,102,136,174,220,275,335,405,486,573,672,784,903,1036,1184,1340,1512,1701,1899,2115,2350,2595,","url":"https://oeis.org/A140462"}],"generated_note":"derived view; the signed event log is the source of truth (vela check / vela reproduce)"}