Matches in DBpedia 2015-10 for { ?s ?p "In combinatorics, a matroid embedding is a set system (F, E), where F is a collection of feasible sets, that satisfies the following properties: (Accessibility Property) Every non-empty feasible set X contains an element x such that X\{x} is feasible; (Extensibility Property) For every feasible subset X of a basis (i.e., maximal feasible set) B, some element in B but not in X belongs to the extension ext(X) of X, or the set of all elements e not in X such that X∪{e} is feasible; (Closure-Congruence Property) For every superset A of a feasible set X disjoint from ext(X), A∪{e} is contained in some feasible set for either all or no e in ext(X); The collection of all subsets of feasible sets forms a matroid.Matroid embedding was introduced by Helman et al. "@en }
Showing triples 1 to 1 of
1
with 100 triples per page.
- Matroid_embedding comment "In combinatorics, a matroid embedding is a set system (F, E), where F is a collection of feasible sets, that satisfies the following properties: (Accessibility Property) Every non-empty feasible set X contains an element x such that X\{x} is feasible; (Extensibility Property) For every feasible subset X of a basis (i.e., maximal feasible set) B, some element in B but not in X belongs to the extension ext(X) of X, or the set of all elements e not in X such that X∪{e} is feasible; (Closure-Congruence Property) For every superset A of a feasible set X disjoint from ext(X), A∪{e} is contained in some feasible set for either all or no e in ext(X); The collection of all subsets of feasible sets forms a matroid.Matroid embedding was introduced by Helman et al. ".