If $G$ is a graph on $n$ vertices without a $K_{4}$ then how large a triangle-free induced subgraph must $G$ contain?

Worked, still open.

graph theory · open · possible · 0 attempts

use this record

vela registry pull vfr_37aec80d874a0239

vela reproduce examples/erdos-problems

evidence

unverified AI candidates (2)

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

Let (\Delta=\Delta(G)) be the maximum degree of $G$.

llm-hunter · gpt pro 5.2 · unverified

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

open