✦ 5 frontiers

read-only vieweressays

erdős #556

← #555 · #557 → (packet.json; erdosproblems.com)

Let $R_{3} (G)$ denote the minimal $m$ such that if the edges of $K_{m}$ are $3$ -coloured then there must be a monochromatic copy of $G$ . Show that $R_{3} (C_{n}) \leq 4 n - 3.$

Worked, still open.

graph theory · open · 0 attempts

use this record

vela registry pull vfr_37aec80d874a0239

vela reproduce examples/erdos-problems

oeis

A389335 — a(n) is the smallest m such that for every red-green-blue edge-coloring of the graph K_{m} there exists at least one red, green or blue n-cycle; Ramsey number r(C_n, C_n, C_n).17,11,17,12,25,16

links

#25 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