{"schema":"vela.problem-packet.v0.1","problem":809,"statement":"Define the anti-Ramsey number $\\chi_S(n,e,G)$ as the smallest $r$ such that there is a graph with $n$ vertices and $e$ edges with an $r$-colouring of its edges in which every copy of $G$ has entirely distinct edge colours.Is it true that, for all $k\\geq 3$,\\[\\chi_S(n, \\lfloor n^2/4\\rfloor+1,C_{2k+1})\\sim n^2/8?\\]","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)"}