✦ 5 frontiers

read-only vieweressays

erdős #551

← #550 · #552 → (packet.json; erdosproblems.com)

Prove that $R (C_{k}, K_{n}) = (k - 1) (n - 1) + 1$ for $k \geq n \geq 3$ (except when $n = k = 3$ ).

Worked, still open.

graph theory · open · 0 attempts

use this record

vela registry pull vfr_37aec80d874a0239

vela reproduce examples/erdos-problems

links

#18 in Ramsey Theory · link

Create a formalisation here · link

status

open

finding.noted · reviewer:will-blair · 1 day

renders the record as of vev_d199cb2e · 1,338 events · hub