Skip to main content

All Questions

Filter by
Sorted by
Tagged with
2 votes
1 answer
177 views

Like transitive reduction, but removing vertices rather than edges?

Suppose I have a directed graph $G = (V, E)$ (or, which is the same, a relation on the set $V$ as defined by the adjacency matrix) that may contain three vertices $x, y, z$, such that $xy, xz, yz \in ...
Ignat Insarov's user avatar