erdős #552
Determine the Ramsey numberwhere is the star on vertices.In particular, is it true that, for any , there are infinitely many such that
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 [ f(n):=R(C_4,S_n)=R(C_4,K_{1,n}), ] where (S_n=K_{1,n}) is the star on $n+1$ vertices.
candidate solution ↗llm-hunter · gpt pro 5.2 · unverified
1 LLM attack(s) recorded (gpt pro 5.2); unverified.
candidate solution ↗oeis
links
#19 in Ramsey Theory · link
Create a formalisation here · link
#85Let and be minimal such that every graph on vertices with minimal degree contains a . Is it true that, for all large , ?A006672status
open