Circle grids and bipartite graphs of distances

Fort fixed,n+t pointsA ₁,A ₂,...,A _n andB ₁,B ₂,...,B _t are constructed in the plane withO(n) distinct distancesd(A _i B _j ) As a by-product we show that the graph of thek largest distances can contain a complete subgraphK _{t, n} withn=(k ²), which settles a problem of Erds, Lovász and Vesztergombi.Research partially supported by the Hungarian National Science Fund (OTKA) # 2117.