Lesson plan

Matroid embedding

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. # 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 e or no e in ext(X). # The collection of all subsets of feasible sets forms a matroid. Matroid embeddings were introduced by to characterize problems that can be optimized by a greedy algorithm.

Back to article

Article summary

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. # 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 e or no e in ext(X). # The collection of all subsets of feasible sets forms a matroid. Matroid embeddings were introduced by to characterize problems that can be optimized by a greedy algorithm.

Key claims

No claims recorded.

Discussion questions

  1. Summarise the article in your own words. Which single claim would you verify first, and why?
  2. Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
  3. If two sources disagreed about one of these facts, what would you need in order to trust one over the other?

Bibliography

No sources recorded.

Key claims and bibliography are generated from the same tracked claims and sources as the article page.