Pages that link to "Definition:Matroid"
Jump to navigation
Jump to search
The following pages link to Definition:Matroid:
Displayed 50 items.
- Uniform Matroid is Matroid (← links)
- Free Matroid is Matroid (← links)
- Matroid Induced by Linear Independence in Vector Space is Matroid (← links)
- Cycle Matroid is Matroid (← links)
- Matroid Induced by Algebraic Independence is Matroid (← links)
- Matroid Induced by Affine Independence is Matroid (← links)
- Matroid Induced by Linear Independence in Abelian Group is Matroid (← links)
- Independent Set can be Augmented by Larger Independent Set (← links)
- All Bases of Matroid have same Cardinality (← links)
- Element is Loop iff Member of Closure of Empty Set (← links)
- Singleton is Dependent implies Rank is Zero/Corollary (← links)
- Superset of Dependent Set is Dependent/Corollary (← links)
- Closure of Subset contains Loop (← links)
- Element is Loop iff Singleton is Circuit (← links)
- Element is Member of Base iff Not Loop (← links)
- Distinct Elements are Parallel iff Pair forms Circuit (← links)
- Parallel Relationship is Transitive (← links)
- Distinct Matroid Elements are Parallel iff Each is in Closure of Other (← links)
- Closure of Subset Contains Parallel Elements (← links)
- Set with Two Parallel Elements is Dependent (← links)
- Loop Belongs to Every Flat (← links)
- Parallel Elements Depend on Same Subsets (← links)
- Matroid Contains No Loops iff Empty Set is Flat (← links)
- Rank of Empty Set is Zero (← links)
- Rank Function is Increasing (← links)
- Bounds for Rank of Subset (← links)
- Equivalence of Definitions of Matroid Rank Axioms/Condition 3 Implies Condition 1 (← links)
- Singleton is Independent implies Rank is One/Corollary (← links)
- Singleton is Independent implies Rank is One (← links)
- Singleton is Dependent implies Rank is Zero (← links)
- Superset of Dependent Set is Dependent (← links)
- Maximization Problem for Independence Systems (← links)
- Maximization Problem for Independence Systems/Greedy Algorithm (← links)
- Greedy Algorithm guarantees Maximum Weight iff Matroid (← links)
- Independent Subset is Contained in Base (← links)
- Equivalent Conditions for Element is Loop (← links)
- Union with Disjoint Singleton is Dependent if Element Depends on Subset (← links)
- Element Depends on Independent Set iff Union with Singleton is Dependent (← links)
- Element Depends on Independent Set iff Union with Singleton is Dependent/Lemma (← links)
- Rank of Independent Subset Equals Cardinality (← links)
- Distinct Matroid Elements are Parallel iff Each is in Closure of Other/Lemma (← links)
- Independent Subset is Contained in Maximal Independent Subset (← links)
- Independent Subset is Base if Cardinality Equals Rank of Matroid (← links)
- Equivalence of Definitions of Matroid (← links)
- Element of Matroid Base and Circuit has Substitute (← links)
- Element of Matroid Base and Circuit has Substitute/Lemma 1 (← links)
- All Bases of Matroid have same Cardinality/Corollary (← links)
- Independent Set can be Augmented by Larger Independent Set/Corollary (← links)
- Independent Subset is Base if Cardinality Equals Rank of Matroid/Corollary (← links)
- Element of Matroid Base and Circuit has Substitute/Lemma 2 (← links)