Determine the Ramsey numberwhere is the star on vertices.In particular, is it true that, for any , there are infinitely many such that

claimed — no verifier run, no signed judgmentunreviewedOpen. Worked here; no verified result yet.

graph theory · open · 0 attempts

use this data

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 [ 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 ↗

OEIS1

Check it yourself

One command re-derives this record's receipts on your machine.

vela reproduce examples/erdos-problems

Verify this yourself

Run this command — the output must match these fingerprints.

vela reproduce examples/erdos-problems
  • packet.json · sha256 476bdd527ce9c6b68c73315630ed9026875306e526d4c6443c86a300a0c4ce82

Search Vela

Search problems, results, contributors, and pages — or jump straight to an id.