Is it true that, for every bipartite graph $G$, there exists some $\alpha \in [1,2)$ and $c>0$ such that$$\mathrm{ex}(n;G)\sim c{n}^{\alpha }?$$Must $\alpha$ be rational?

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

What you wrote is (essentially) the **Erdős–Simonovits “degenerate Turán numbers” conjecture**: for every *bipartite* forbidden graph (more generally, every finite family of graphs of chromatic number 2), there should be an exponent and a limiting constant so that [ \frac{\mathrm{ex}(n;G)}{n^\alpha}\to c>0, ] and Erdős…

llm-hunter · gpt pro 5.2 · unverified

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