Category:Matroid Theory

From ProofWiki

Jump to navigation Jump to search

This category contains results about Matroid Theory.
Definitions specific to this category can be found in Definitions/Matroid Theory.

Matroid Theory is the branch of mathematics which concerns the role which matroids play in disparate branches of combinatorial theory and algebra such as graph theory, lattice theory, combinatorial optimization, and linear algebra.

Subcategories

This category has the following 14 subcategories, out of 14 total.

E

Equivalence of Definitions of Matroid‎ (6 P)
Examples of Matroids‎ (11 P)

M

Matroid Bases‎ (2 C, 14 P)
Matroid Circuits‎ (3 C, 15 P)
Matroid Closure‎ (1 C, 4 P)
Matroid Dependence‎ (1 C, 3 P)
Matroid Dependent Subsets‎ (1 C, 10 P)
Matroid Flats‎ (2 P)
Matroid Independent Subsets‎ (1 C, 15 P)
Matroid Loops‎ (8 P)
Matroid Parallelism‎ (1 C, 6 P)
Matroid Rank Functions‎ (2 C, 14 P)
Matroid Unique Circuit Property‎ (4 P)
Maximization Problem for Independence Systems‎ (6 P)

Pages in category "Matroid Theory"

The following 8 pages are in this category, out of 8 total.

C

Cycle Matroid is Matroid

E

Equivalence of Definitions of Matroid

F

Free Matroid is Matroid

M

U

Uniform Matroid is Matroid

Retrieved from "https://proofwiki.org/w/index.php?title=Category:Matroid_Theory&oldid=432297"

Combinatorics