erdős #620 · Erdős-Rogers problem
If is a graph on vertices without a then how large a triangle-free induced subgraph must contain?
unreviewedOpen. Worked here; no verified result yet.
graph theory · open · possible · 0 attempts
use this data
vela registry pull vfr_37aec80d874a0239vela reproduce examples/erdos-problemsEvidence
unverified AI candidates (2)
gpt-erdos · GPT-5.2 Pro + Deep Research · unverified
Let (\Delta=\Delta(G)) be the maximum degree of $G$.
candidate solution ↗llm-hunter · gpt pro 5.2 · unverified
1 LLM attack(s) recorded (gpt pro 5.2); unverified.
candidate solution ↗Connections1
Create a formalisation here · link
Check it yourself
One command re-derives this record's receipts on your machine.
vela reproduce examples/erdos-problems