User:David Eppstein/Matroid Theory
border=1 cellspacing=20 class="floatright" |
{{pp-book-cover
|title=Matroid Theory |subtitle= |cover-image=Möbius–Kantor configuration symmetric.svg |cover-color=#76b3df }} |
Matroid Theory
;Basic concepts
:{{annotated link|Matroid}}
:{{annotated link|Dual matroid}}
:{{annotated link|Matroid rank}}
;Examples
:{{annotated link|Fano plane}}
:{{annotated link|Uniform matroid}}
:{{annotated link|Vámos matroid}}
:{{annotated link|Möbius–Kantor configuration|MacLane matroid}}
;Matroids from linear algebra
:{{annotated link|Matroid representation}}
:{{annotated link|Linear independence}}
:{{annotated link|Basis (linear algebra)}}
:{{annotated link|Rank (linear algebra)}}
:{{annotated link|Steinitz exchange lemma}}
:{{annotated link|Binary matroid}}
:{{annotated link|Regular matroid}}
:{{annotated link|Spark (mathematics)}}
;Matroids from abstract algebra
:{{annotated link|Algebraic matroid}}
:{{annotated link|Algebraic independence}}
:{{annotated link|Transcendence degree}}
:{{annotated link|Dowling geometry}}
;Matroids from graphs
:{{annotated link|Graphic matroid}}
:{{annotated link|Spanning tree}}
:{{annotated link|Circuit rank}}
:{{annotated link|Cycle space}}
:{{annotated link|Cycle basis}}
:{{annotated link|Bicircular matroid}}
:{{annotated link|Gammoid}}
:{{annotated link|Biased graph}}
:{{annotated link|Gain graph}}
:{{annotated link|Signed graph}}
;Additional constructions of matroids
:{{annotated link|Partition matroid}}
:{{annotated link|Paving matroid}}
:{{annotated link|Rigidity matroid}}
;Structures equivalent to matroids
:{{annotated link|Cryptomorphism}}
:{{annotated link|Geometric lattice}}
:{{annotated link|Pregeometry (model theory)}}
;Oriented matroids
:{{annotated link|Oriented matroid}}
:{{annotated link|CC system}}
:{{annotated link|Mnëv's universality theorem}}
:{{annotated link|Separoid}}
;Algorithmic problems on matroids
:{{annotated link|Greedy algorithm}}
:{{annotated link|Weighted matroid}}
:{{annotated link|Minimum spanning tree}}
:{{annotated link|Matroid intersection}}
:{{annotated link|Matroid partitioning}}
:{{annotated link|Matroid parity problem}}
:{{annotated link|Matroid oracle}}
:{{annotated link|Criss-cross algorithm}}
;Matroid generalizations of graph theory
:{{annotated link|Matroid girth}}
:{{annotated link|Bipartite matroid}}
:{{annotated link|Eulerian matroid}}
:{{annotated link|Ear decomposition}}
:{{annotated link|Branch-decomposition}}
:{{annotated link|Clique-sum}}
:{{annotated link|Matroid minor}}
:{{annotated link|Rota's conjecture}}
:{{annotated link|Tutte homotopy theorem}}
:{{annotated link|Whitney's planarity criterion}}
;Matroid generalizations of discrete geometry
:{{annotated link|Sylvester matroid}}
:{{annotated link|Sylvester–Gallai theorem}}
:{{annotated link|Rota's basis conjecture}}
:{{annotated link|K-set (geometry)}}
:{{annotated link|Arrangement of hyperplanes}}
;Matroid polynomials
:{{annotated link|Tutte polynomial}}
:{{annotated link|Colored matroid}}
:{{annotated link|Ingleton's inequality}}
;Related structures
:{{annotated link|Greedoid}}
:{{annotated link|Antimatroid}}
:{{annotated link|Coxeter matroid}}
:{{annotated link|Matroid embedding}}
:{{annotated link|Matroid polytope}}
:{{annotated link|Polymatroid}}
:{{annotated link|Submodular set function}}