In combinatorics, a matroid embedding is a set system (F, E), where F is a collection of feasible sets, that satisfies the following properties.
Matroid embedding was introduced by Helman, Moret & Shapiro (1993) to characterize problems that can be optimized by a greedy algorithm.