Matroid embedding
id:
matroid-embedding-270-16104459
title:
Matroid embedding
text:
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, where ext(X) is the set of all elements e not in X such that X ∪ {e} is feasible.
C
brand slug:
wiki
category slug:
encyclopedia
description:
Set system related to matroids
original url:
https://en.wikipedia.org/wiki/Matroid_embedding
date created:
date modified:
2022-10-31T19:28:52Z
main entity:
{"identifier":"Q6787902","url":"https://www.wikidata.org/entity/Q6787902"}
image:
fields total:
13
integrity:
14