{"schema":"vela.problem-packet.v0.1","problem":927,"statement":"Let $g(n)$ be the maximum number of different sizes of cliques that can occur in a graph on $n$ vertices. Estimate $g(n)$ - in particular, is it true that\\[g(n)=n-\\log_2n-\\log_*(n)+O(1),\\]where $\\log_*(n)$ is the number of iterated logarithms such that $\\log\\cdots \\log n <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)"}