Let $\delta >0$. If $n$ is sufficiently large and $G$ is a graph on $n$ vertices with no $K_{2,2,2}$ and at least $\delta n^2$ edges then $G$ contains an independent set of size ${\gg }_{\delta }n$.

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

What you wrote is **exactly** the classical Erdős–Hajnal–Sós–Szemerédi question for the **octahedron** (K_{2,2,2}), and in full generality it is **still open**.

llm-hunter · gpt pro 5.2 · unverified

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