Prove that there is a constant c>0 such that for any n>3 there exists a planar graph G with n vertices such that every straight-edged plane embedding of G has a pair of edges with ratio of lengths at least cn. college contestsMiklos Schweitzerratiograph theory