{"schema":"vela.problem-packet.v0.1","problem":902,"statement":"Let $f(n)$ be minimal such that there is a tournament (a complete directed graph) on $f(n)$ vertices such that every set of $n$ vertices is dominated by at least one other vertex. Estimate $f(n)$.","status":"open","seam":"raw","closureRoutes":[],"obligations":[],"attestations":[],"attempts":[],"velaLean":[],"oeis":[{"id":"A362137","name":"Smallest size of an n-paradoxical tournament built as a directed Paley graph.","terms":"1,3,7,19,67,331,1163","url":"https://oeis.org/A362137"}],"generated_note":"derived view; the signed event log is the source of truth (vela check / vela reproduce)"}