Mason's Theorem for Directed Linkages is a result in [matroid theory](/page/Matroid%20Theory). It formalizes the assertion that let be a finite directed graph, and let . Call a subset linkable to if there exists a family of pairwise vertex disjoint directed paths in such that, for each , the path starts at and ends at a vertex of , and the endpoints in are.