Let $f(n)$ be the minimal $m$ such that if the edges of $K_{2^n+1}$ are coloured with $n$ colours then there must be a monochromatic odd cycle of length at most $m$. Estimate $f(n)$.

gpt-erdos · GPT-5.2 Pro + Deep Research · unverified

Write $f(n)$ for the smallest $m$ such that **every** $n$-edge-colouring of (K_{2^n+1}) contains a monochromatic odd cycle of length (\le m).

llm-hunter · gpt pro 5.2 · unverified

1 LLM attack(s) recorded (gpt pro 5.2); unverified.