A bipartite graph on the sets {x1,…,xn} and {y1,…,yn} of vertices (that is the edges are of the form xiyj ) is called tame if it has no xiyjxkyl path ( i,j,k,l∈{1,…,n} ) where j<l and i+j>k+l . Calculate the infimum of those real numbers α for which there exists a constant c=c(α)>0 such that for all tame graphs e≤cnα , where e is the number of edges and n is half of the number of vertices.
(translated by Miklós Maróti)