Perfect and nearly perfect separation dimension of complete and random graphs

Abstract

The separation dimension of a hypergraph G is the smallest natural number d for which there is an embedding of G into ℝ d , such that any pair of disjoint edges is separated by some hyperplane normal to one How to cite this article: R. Yuster, Perfect and nearly perfect separation dimension of complete and random graphs,