Perfect and nearly perfect separation dimension of complete and random graphs
Perfect and nearly perfect separation dimension of complete and random graphs
Abstract The separation dimension of a hypergraph is the smallest natural number for which there is an embedding of into , such that any pair of disjoint edges is separated by some hyperplane normal to one of the axes. The perfect separation dimension further requires that any pair of disjoint …