Wikipedia
Gammoid
In matroid theory, a field within mathematics, a gammoid is a certain kind of matroid, describing sets of vertices that can be reached by vertex-disjoint paths in a directed graph.
The concept of a gammoid was introduced and shown to be a matroid by , based on considerations related to Menger's theorem characterizing the obstacles to the existence of systems of disjoint paths. Gammoids were studied in more detail and given their name by .