Let $n\ge k+1$. Every graph on $n$ vertices with at least $\frac{k-1}{2}n+1$ edges contains every tree on $k+1$ vertices.

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

The statement you wrote is exactly the **Erdős–Sós conjecture**:

llm-hunter · gpt pro 5.2 · unverified

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