erdős #597
Let be a graph on at most vertices which contains no and no (the complete bipartite graph with vertices in each class). Is it true thatWhat about finite ?
Worked, still open.
graph theory · open · 0 attempts
use this record
vela registry pull vfr_37aec80d874a0239vela reproduce examples/erdos-problemsevidence
unverified AI candidates (2)
gpt-erdos · GPT-5.2 Pro + Deep Research · unverified
Let me first unpack the notation the way it is usually meant in this part of partition calculus.
candidate solution ↗llm-hunter · gpt pro 5.2 · unverified
1 LLM attack(s) recorded (gpt pro 5.2); unverified.
candidate solution ↗links
Create a formalisation here · link
status
open