F. Escalante and T. Gallai studied in the seventies the structure of different kind of separations and cuts between a vertex pair in a (possibly infinite) graph. One of their results is that if there is a finite separation, then the optimal (i.e. minimal sized) separations form a finite distributive lattice with respect to a natural partial order. Furthermore, any finite distributive lattice can be represented this way. If there is no finite separation then cardinality is a too rough measure to capture being 'optimal'. Menger's theorem provides a structural characterization of optimality if there is a finite separation. We use this characterization to define Erdős-Menger separations even if there is no finite separation. The generalization of Menger's theorem to infinite graphs (which was not available until 2009) ensures that Erdős-Menger separations always exist. We show that they form a complete lattice with respect to the partial order given by Escalante and every complete lattice can be represented this way.