{"schema":"vela.problem-packet.v0.1","problem":1216,"statement":"A tournament is a complete directed graph. Let $f(n)$ be such that every tournament on $n$ vertices contains a transitive tournament on $f(n)$ vertices (i.e. one such that if $i\\to j\\to k$ then $i\\to k$).Is it true that $f(n)=\\lfloor \\log_2 n\\rfloor +1$?","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)"}