Let $k\ge 3$. Does there exist some $f(k)$ such that if a graph $G$ has chromatic number $\ge f(k)$ then $G$ must contain some odd cycle whose vertices span a graph of chromatic number $\ge k$?

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

This is **open** (at least as of early 2026).

llm-hunter · gpt pro 5.2 · unverified

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