Almost every graph is vertex-oblique Original Research Article

The type of a vertex image of a graph G is the ordered degree sequence of the vertices adjacent to image. The graph G is called vertex-oblique if it contains no two vertices of the same type. We will show that almost every graph image is vertex-oblique, if the probability p for each edge to appear in G is within certain bounds.