. "Thus a causal directed acyclic graph that is minimal with respect to A, Y, and X is the smallest causal directed acyclic graph that contains A, Y, and X. Furthermore, any causal directed acyclic graph with A, Y, and X can be reduced to one that is minimal with respect to A, Y, and X by eliminating all variables other than A, Y, X, and their common causes." . . .