For any collection of graphs G1, . . . , GN we find the minimal dimension d such that the product G1 × · · · ×GN is embeddable into R . In particular, we prove that (K5) and (K3,3) are not embeddable into R, where K5 and K3,3 are the Kuratowski graphs. This is a solution of a problem of Menger from 1929. The idea of the proof is the reduction to a problem from so-called Ramsey link theory: we s...