Editing Matroid

{{Short description|Abstraction of linear independence of vectors}}
{{Distinguish|Metroid|Meteoroid}}
{{CS1 config|mode=cs1}}
In [[combinatorics]], a '''matroid''' {{IPAc-en|ˈ|m|eɪ|t|r|oɪ|d}} is a structure that abstracts and generalizes the notion of [[linear independence]] in [[vector space]]s. There are many equivalent ways to define a matroid [[Axiomatic system|axiomatically]], the most significant being in terms of: independent sets; bases or circuits; rank functions; closure operators; and closed sets or ''flats''. In the language of [[partially ordered set]]s, a finite simple matroid is equivalent to a [[geometric lattice]].

Matroid theory borrows extensively from the terms used in both [[linear algebra]] and [[graph theory]], largely because it is the abstraction of various notions of central importance in these fields. Matroids have found applications in [[geometry]], [[topology]], [[combinatorial optimization]], [[network theory]], and [[coding theory]].<ref name=Neel2009>{{harvp|Neel|Neudauer|2009}}</ref><ref name=Kashyap2009>{{harvp|Kashyap|Soljanin|Vontobel|2009}}</ref>

==Definition== <!-- [[Hereditary property (matroid)]] redirects to this section title -->
There are many [[Cryptomorphism|equivalent]] ways to define a (finite) matroid.{{efn|
{{harvp|Oxley|1992}} is a standard source for basic definitions and results about matroids; {{harvp|Welsh|1976}} is an older standard source.
:
See the appendix by Brylawski in {{harvp|White|1986|pp=298–302}}, for a list of matroid axiom systems that are equivalent.
:
}}

=== Independent sets <span class="anchor" id="independent_sets_anchor"></span>===
In terms of independence, a finite matroid <math> M </math> is a pair <math> (E, \mathcal{I})</math>, where <math> E </math> is a [[finite set]] (called the ''ground set'') and <math> \mathcal{I} </math> is a [[family of sets|family]] of [[subset]]s of <math> E </math> (called the ''independent sets'') with the following properties:<ref name=w7-9>{{harvtxt|Welsh|1976|pp=7–9}}, Section&nbsp;1.2, "Axiom Systems for a Matroid".</ref>

* (I1)  The [[empty set]] is independent, i.e., <math> \emptyset \in \mathcal{I}</math>.

* (I2)  Every subset of an independent set is independent, i.e., for each <math> A' \subseteq A \subseteq E</math>, if <math> A \in \mathcal{I} </math> then <math> A' \in \mathcal{I}</math>. This is sometimes called the ''hereditary property'', or the ''downward-closed'' property.

* (I3) If <math>A</math> and <math>B</math> are two independent sets (i.e., each set is independent) and <math>A</math> has more elements than <math> B</math>, then there exists <math> x \in A \setminus B</math> such that <math> B \cup \{ x \} </math> is in <math> \mathcal{I}</math>. This is sometimes called the ''augmentation property'' or the ''independent set exchange property''.

The first two properties define a combinatorial structure known as an [[independence system]] (or [[abstract simplicial complex]]). Actually, assuming (I2), property (I1) is equivalent to the fact that at least one subset of <math>E</math> is independent, i.e., <math>\mathcal{I}\neq\emptyset</math>.

=== Bases and circuits <span class="anchor" id="bases_circuits_anchor"></span> ===
{{Main|Basis of a matroid}}
A subset of the ground set <math> E </math> that is not independent is called ''dependent''. A maximal independent set – that is, an independent set that becomes dependent upon adding any element of <math>E</math> – is called a ''basis'' for the matroid. A ''circuit'' in a matroid <math> M </math> is a minimal dependent subset of <math>E</math> – that is, a dependent set whose proper subsets are all independent. The term arises because the circuits of [[graphic matroid]]s are cycles in the corresponding graphs.<ref name=w7-9/>

The dependent sets, the bases, or the circuits of a matroid characterize the matroid completely: a set is independent if and only if it is not dependent, if and only if it is a subset of a basis, and if and only if it does not contain a circuit. The collections of dependent sets, of bases, and of circuits each have simple properties that may be taken as axioms for a matroid. For instance, one may define a matroid <math> M </math> to be a pair <math> (E,\mathcal{B}) </math>, where <math> E </math> is a finite set as before and <math> \mathcal{B} </math> is a collection of subsets of <math> E</math>, called ''bases'', with the following properties:<ref name=w7-9/>

* (B1) <math> \mathcal{B} </math> is nonempty.

* (B2) If <math> A </math> and <math> B </math> are distinct members of <math> \mathcal{B} </math> and <math> a \in A \smallsetminus B</math>, then there exists an element <math> b \in B \smallsetminus A </math> such that <math> (A \smallsetminus \{ a \}) \cup \{b\} \in \mathcal{B}</math>.

This property (B2) is called the ''basis exchange property''. It follows from this property that no member of <math> \mathcal{B} </math> can be a proper subset of any other.

=== Rank functions <span class="anchor" id="rank_func_anchor"></span> ===
It is a basic result of matroid theory, directly analogous to a similar theorem of [[basis (linear algebra)|bases in linear algebra]], that any two bases of a matroid <math> M </math> have the same number of elements.  This number is called the ''[[matroid rank|rank]]'' {{nobr|of <math> M</math>.}} If <math> M </math> is a matroid on <math>E</math>, and <math>A</math> is a subset of <math>E</math>, then a matroid on <math> A </math> can be defined by considering a subset of <math> A </math> to be independent if and only if it is independent in <math> M</math>. This allows us to talk about ''submatroids'' and about the rank of any subset of <math> E</math>. The rank of a subset <math>A</math> is given by the ''[[matroid rank|rank function]]'' <math> r(A) </math> of the matroid, which has the following properties:<ref name=w7-9/>

*(R1) The value of the rank function is always a non-negative [[integer]].

*(R2) For any subset <math>A\subset E</math>, we have <math>r(A) \le |A|</math>. 

*(R3) For any two subsets <math>A, B\subset E</math>, we have: <math> r(A \cup B) + r(A \cap B) \le r(A) + r(B)</math>. That is, the rank is a [[submodular function]].

*(R4) For any set <math>A</math> and element <math> x</math>, we have: <math> r(A) \le r( A \cup \{x\} ) \le r(A) + 1</math>. From the first inequality it follows more generally that, if <math> A \subseteq B \subseteq E</math>, then <math> r(A) \leq r(B )\leq r(E)</math>. That is, rank is a [[monotonic function]].

These properties can be used as one of the alternative definitions of a finite matroid: If <math> (E,r) </math> satisfies these properties, then the independent sets of a matroid over <math> E </math> can be defined as those subsets <math> A </math> of <math>E</math> with <math> r(A) = |A|</math>. In the language of [[partially ordered set]]s, such a matroid structure is equivalent to the [[geometric lattice]] whose elements are the subsets <math> A \subset M</math>, partially ordered by inclusion.

The difference <math>|A| - r(A)</math> is called the ''nullity'' of the subset <math> A</math>. It is the minimum number of elements that must be removed from <math> A </math> to obtain an independent set. The nullity of <math>E</math> in <math>M</math> is called the nullity of <math> M</math>. The difference <math>r(E) - r(A)</math> is sometimes called the ''corank'' of the subset <math>A</math>.

=== Closure operators <span class="anchor" id="closure_ops_anchor"></span> ===
Let <math>M</math> be a matroid on a finite set <math> E</math>, with rank function <math>r</math> as above.  The ''closure'' or ''span'' <math> \operatorname{cl}(A) </math> of a subset <math>A</math> of <math>E</math> is the set
:<math> \operatorname{cl}(A) = \Bigl\{\ x \in E \mid r(A) = r\bigl( A \cup \{x\} \bigr) \Bigr\}</math>.
This defines a [[closure operator]] <math> \operatorname{cl}: \mathcal{P}(E) \mapsto \mathcal{P}(E) </math> where <math>\mathcal{P}</math> denotes the [[power set]], with the following properties:

* (C1) For all subsets <math> X </math> of <math> E</math>, <math> X \subseteq \operatorname{cl}(X)</math>. 

* (C2) For all subsets <math>X</math> of <math> E</math>, <math>\operatorname{cl}(X)= \operatorname{cl}\left( \operatorname{cl}\left( X \right) \right)</math>. 

* (C3) For all subsets <math>X</math> and <math>Y</math> of <math>E</math> with <math> X\subseteq Y</math>, <math>\operatorname{cl}(X)\subseteq \operatorname{cl}(Y)</math>.

* (C4) For all elements <math>a</math> and <math>b</math> from <math>E</math> and all subsets <math>Y</math> of <math>E</math>, if <math> a \in \operatorname{cl}( Y \cup \{b\}) \smallsetminus \operatorname{cl}(Y)</math> then <math> b \in \operatorname{cl}( Y \cup \{a\}) \smallsetminus \operatorname{cl}(Y)</math>. 

The first three of these properties are the defining properties of a closure operator. The fourth is sometimes called the ''[[Saunders Mac Lane|Mac Lane]]–[[Ernst Steinitz|Steinitz]] exchange property''. These properties may be taken as another definition of matroid: every function <math>\operatorname{cl}: \mathcal{P}(E)\to \mathcal{P}(E)</math> that obeys these properties determines a matroid.<ref name=w7-9/>

=== Flats<span class="anchor" id="closed_sets_flats_anchor"></span> ===
A set whose closure equals itself is said to be ''closed'', or a ''flat'' or ''subspace'' of the matroid.<ref>{{harvtxt|Welsh|1976|pp=21–22}}, Section&nbsp;1.8, "Closed sets = Flats = Subspaces".</ref> A set is closed if it is [[maximal element|maximal]] for its rank, meaning that the addition of any other element to the set would increase the rank. The closed sets of a matroid are characterized by a covering partition property:

* (F1) The whole point set <math>E</math> is closed.

* (F2) If <math>S</math> and <math>T</math> are flats, then <math>S\cap T</math> is a flat.

* (F3) If <math>S</math> is a flat, then each element of <math>E\smallsetminus S</math> is in precisely one of the flats <math>T</math> that [[Covering relation|cover]] <math>S</math> (meaning that <math>T</math> properly contains <math>S</math>, but there is no flat <math>U</math> between <math>S</math> and <math>T</math>).

The class <math>\mathcal{L}(M)</math> of all flats, [[partially ordered set|partially ordered]] by set inclusion, forms a [[matroid lattice]]. Conversely, every matroid lattice <math>L</math> forms a matroid over its set <math>E</math> of [[Atom (order theory)|atoms]] under the following closure operator:  for a set <math>S</math> of atoms with join <math> \bigvee S</math>, 
:<math>\operatorname{cl}(S) = \{ x\in E\mid x\le\bigvee S \}</math>. 
The flats of this matroid correspond one-for-one with the elements of the lattice; the flat corresponding to lattice element <math>y</math> is the set
:<math>\{ x\in E\mid x\le y\}</math>. 
Thus, the lattice of flats of this matroid is naturally isomorphic to <math>L</math>.

===Hyperplanes===
In a matroid of rank <math> r</math>, a flat of rank <math>r - 1</math> is called a ''hyperplane''. (Hyperplanes are also called ''co-atoms'' or ''copoints''.) These are the maximal proper flats; that is, the only superset of a hyperplane that is also a flat is the set <math>E</math> of all the elements of the matroid. An equivalent definition is that a coatom is a subset of ''E'' that does not span ''M'', but such that adding any other element to it does make a spanning set.<ref name=w38-39>{{harvtxt|Welsh|1976|pp=38–39}}, Section&nbsp;2.2, "The Hyperplanes of a Matroid".</ref>

The family <math>\mathcal{H}</math> of hyperplanes of a matroid has the following properties, which may be taken as yet another axiomatization of matroids:<ref name=w38-39/>

* (H1) There do not exist distinct sets <math>X</math> and <math>Y</math> in <math>\mathcal{H}</math> with <math> X \subseteq Y</math>. That is, the hyperplanes form a [[Sperner family]].

* (H2) For every <math> x \in E </math> and distinct <math> Y, Z \in \mathcal{H} </math> with <math> x\notin Y \cup Z</math>, there exists <math> X \in \mathcal{H} </math> with <math> (Y \cap Z) \cup \{x\} \subseteq X</math>.

===Graphoids===

[[George J. Minty|Minty]] (1966) defined a ''graphoid'' as a triple <math>(L, C, D)</math> in which <math>C</math> and <math>D</math> are classes of nonempty subsets of <math>L</math> such that 

*(G1) no element of <math>C</math> (called a "circuit") contains another, 

*(G2) no element of <math>D</math> (called a "cocircuit") contains another, 

*(G3) no set in <math>C</math> and set in <math>D</math> intersect in exactly one element, and 

*(G4) whenever <math>L</math> is represented as the disjoint union of subsets <math> R, G, B </math> with <math>G = \{ g \}</math> (a singleton set), then either an <math>X \in C</math> exists such that <math>g \in X \subseteq R \cup G</math> or a <math>Y \in D</math> exists such that <math>g \in Y \subseteq B \cup G</math>.

He proved that there is a matroid for which <math>C</math> is the class of circuits and <math>D</math> is the class of cocircuits. Conversely, if <math>C</math> and <math>D</math> are the circuit and cocircuit classes of a matroid <math>M</math> with ground set <math> E</math>, then <math>(E, C, D)</math> is a graphoid. Thus, graphoids give a ''self-dual cryptomorphic axiomatization'' of matroids.

== Examples ==

=== Free matroid ===
Let <math>E</math> be a finite set. The set of all subsets of <math>E</math> defines the independent sets of a matroid. It is called the [[free matroid]] over <math>E</math>.

===Uniform matroids===
Let <math>E</math> be a finite set and <math>k</math> a [[natural number]]. One may define a matroid on <math>E</math> by taking every {{nobr|<math>k</math> element}} subset of <math>E</math> to be a basis. This is known as the ''[[uniform matroid]]'' of rank <math> k</math>. A uniform matroid with rank <math>k</math> and with <math>n</math> elements is denoted <math> U_{k,n}</math>. All uniform matroids of rank at least 2 are simple (see {{section link||Additional terms}}). The uniform matroid of rank&nbsp;2 on <math>n</math> points is called the <math>n</math>&nbsp;''point line''. A matroid is uniform if and only if it has no circuits of size less than one plus the rank of the matroid. The direct sums of uniform matroids are called [[partition matroid]]s.

In the uniform matroid <math> U_{0,n}</math>, every element is a loop (an element that does not belong to any independent set), and in the uniform matroid <math> U_{n,n}</math>, every element is a coloop (an element that belongs to all bases). The direct sum of matroids of these two types is a partition matroid in which every element is a loop or a coloop; it is called a ''discrete matroid''. An equivalent definition of a discrete matroid is a matroid in which every proper, non-empty subset of the ground set <math>E</math> is a separator.

===Matroids from linear algebra===
[[File:fano plane.svg|thumb|The Fano matroid, derived from the [[Fano plane]]. It is [[GF(2)]]-linear but not real-linear.]]
[[File:Vamos matroid.svg|thumb|The [[Vámos matroid]], not linear over any field]]
Matroid theory developed mainly out of a deep examination of the properties of independence and dimension in vector spaces. There are two ways to present the matroids defined in this way:
: If <math>E</math> is any finite subset of a [[vector space]] <math>V</math>, then we can define a matroid <math>M</math> on <math>E</math> by taking the independent sets of <math>M</math> to be the [[linear independence|linearly independent]] subsets of <math>E</math>.
The validity of the independent set axioms for this matroid follows from the [[Steinitz exchange lemma]].

: If <math>M</math> is a matroid that can be defined in this way, we say the set <math>E</math> ''[[matroid representation|represents]]'' <math>M</math>.

: Matroids of this kind are called ''vector matroids''.

An important example of a matroid defined in this way is the Fano matroid, a rank&nbsp;three matroid derived from the [[Fano plane]], a [[finite geometry]] with seven points (the seven elements of the matroid) and seven lines (the proper nontrivial flats of the matroid). It is a linear matroid whose elements may be described as the seven nonzero points in a three&nbsp;dimensional vector space over the [[finite field]] [[GF(2)]]. However, it is not possible to provide a similar representation for the Fano matroid using the [[real number]]s in place of GF(2).

A [[matrix (mathematics)|matrix]] <math>A</math> with entries in a [[field (mathematics)|field]] gives rise to a matroid <math>M</math> on its set of columns. The dependent sets of columns in the matroid are those that are linearly dependent as vectors.
: This matroid is called the ''column matroid'' of <math>A</math>, and <math>A</math> is said to ''represent'' <math>M</math>.

For instance, the Fano matroid can be represented in this way as a 3&nbsp;&times;&nbsp;7 [[Logical matrix|(0,1)&nbsp;matrix]]. Column matroids are just vector matroids under another name, but there are often reasons to favor the matrix representation.{{efn|
There is one technical difference: A column matroid can have distinct elements that are the same vector, but a vector matroid as defined above cannot. Usually this difference is insignificant and can be ignored, but by letting <math>E</math> be a [[multiset]] of vectors one brings the two definitions into complete agreement.
}}

A matroid that is equivalent to a vector matroid, although it may be presented differently, is called ''representable'' or ''linear''. If <math>M</math> is equivalent to a vector matroid over a [[field (mathematics)|field]] <math>F</math>, then we say <math>M</math> is ''representable over'' {{nobreak|<math>F</math>;}} in particular, <math>M</math> is ''real representable'' if it is representable over the real numbers. For instance, although a graphic matroid (see below) is presented in terms of a graph, it is also representable by vectors over any field.

A basic problem in matroid theory is to characterize the matroids that may be represented over a given field <math>F</math>; [[Rota's conjecture]] describes a possible characterization for every [[finite field]].  The main results so far are characterizations of [[binary matroid]]s (those representable over GF(2)) due to [[W. T. Tutte|Tutte]] (1950s), of ternary matroids (representable over the 3&nbsp;element field) due to Reid and Bixby, and separately to [[Paul Seymour (mathematician)|Seymour]] (1970s), and of quaternary matroids (representable over the 4&nbsp;element field) due to {{harvp|Geelen|Gerards|Kapoor|2000}}. A proof of Rota's conjecture was announced, but not published, in 2014 by Geelen, Gerards, and Whittle.<ref>{{cite journal|title=Solving Rota's conjecture|journal=Notices of the American Mathematical Society|url=http://www.ams.org/notices/201407/rnoti-p736.pdf|date=Aug 17, 2014|pages=736–743}}</ref>

A [[regular matroid]] is a matroid that is representable over all possible fields. The [[Vámos matroid]] is the simplest example of a matroid that is not representable over any field.

===Matroids from graph theory===
A second original source for the theory of matroids is [[graph theory]].

Every finite graph (or [[multigraph]]) <math>G</math> gives rise to a matroid <math>M(G)</math> as follows: take as <math>E</math> the set of all edges in <math>G</math> and consider a set of edges independent if and only if it is a [[tree (graph theory)|forest]]; that is, if it does not contain a [[simple cycle]]. Then <math>M(G)</math> is called a ''cycle matroid''. Matroids derived in this way are ''[[graphic matroid]]s''. Not every matroid is graphic, but all matroids on three elements are graphic.<ref name=Ox13/> Every graphic matroid is regular.

Other matroids on graphs were discovered subsequently:

*The [[bicircular matroid]] of a graph is defined by calling a set of edges independent if every connected subset contains at most one cycle.

*In any directed or undirected graph <math>G</math> let <math>E</math> and <math>F</math> be two distinguished sets of vertices.  In the set <math>E</math>, define a subset <math>U</math> to be independent if there are <math>|U|</math> vertex-disjoint paths from <math>F</math> onto <math>U</math>.  This defines a matroid on <math>E</math> called a ''[[gammoid]]'':<ref name=Ox115/> a ''strict gammoid'' is one for which the set <math>E</math> is the whole vertex set of <math>G</math>.<ref name=Ox100>{{harvp|Oxley|1992|p=100}}</ref>

*In a [[bipartite graph]] <math>G = (U,V,E)</math>, one may form a matroid in which the elements are vertices on one side <math>U</math> of the bipartition, and the independent subsets are sets of endpoints of [[Matching (graph theory)|matchings]] of the graph. This is called a ''transversal matroid'',<ref name=Ox4648>{{harvp|Oxley|1992|pp=46–48}}</ref><ref name=Wh877297>{{harvp|White|1987|pp=72–97}}</ref> and it is a special case of a gammoid.<ref name=Ox115>{{harvp|Oxley|1992|pp=115}}</ref>  The transversal matroids are the [[dual matroid]]s to the strict gammoids.<ref name=Ox100/>

*Graphic matroids have been generalized to matroids from [[signed graph]]s, [[gain graph]]s, and [[biased graph]]s.  A graph <math>G</math> with a distinguished linear class <math>B</math> of cycles, known as a "biased graph" <math>(G, B)</math>, has two matroids, known as the ''frame matroid'' and the ''lift matroid'' of the biased graph.

: If every cycle belongs to the distinguished class, these matroids coincide with the cycle matroid of <math>G</math>. If no cycle is distinguished, the frame matroid is the bicircular matroid of <math>G</math>. A signed graph, whose edges are labeled by signs, and a gain graph, which is a graph whose edges are labeled orientably from a group, each give rise to a biased graph and therefore have frame and lift matroids.

*The [[Laman graph]]s form the bases of the two&nbsp;dimensional [[rigidity matroid]], a matroid defined in the theory of [[structural rigidity]].

*Let <math>G</math> be a connected graph and <math>E</math> be its edge set. Let <math>I</math> be the collection of subsets <math>F</math> of <math>E</math> such that <math> G - F </math> is still connected. Then <math> M^*(G)</math>, whose element set is <math>E</math> and with <math>I</math> as its class of independent sets, is a matroid called the ''bond matroid'' of <math>G</math>.

: The rank function <math>r(F)</math> is the [[cyclomatic number]] of the subgraph induced on the edge subset <math>F</math>, which equals the number of edges outside a maximal forest of that subgraph, and also the number of independent cycles in it.

===Matroids from field extensions===
A third original source of matroid theory is [[field theory (mathematics)|field theory]].

An [[extension field|extension]] of a field gives rise to a matroid: 
: Suppose <math>F</math> and <math>K</math> are fields with <math>K</math> containing <math>F</math>.  Let <math>E</math> be any finite subset of <math>K</math>.
: Define a subset <math>S</math> of <math>E</math> to be [[algebraic independence|algebraically independent]] if the extension field <math>F(S)</math> has [[transcendence degree]] equal to <math>|S|</math>.<ref name=Ox215>{{harvp|Oxley|1992|p=215}}</ref>

A matroid that is equivalent to a matroid of this kind is called an [[algebraic matroid]].<ref name=Ox216>{{harvp|Oxley|1992|p=216}}</ref>  The problem of characterizing algebraic matroids is extremely difficult; little is known about it. The [[Vámos matroid]] provides an example of a matroid that is not algebraic.

== Basic constructions ==
There are some standard ways to make new matroids out of old ones.

===Duality===
If <math> M </math> is a finite matroid, we can define the ''orthogonal'' or ''[[dual matroid]]'' <math>M^*</math> by taking the same underlying set and calling a set a ''basis'' in <math> M^* </math> if and only if its complement is a basis in <math> M</math>. It is not difficult to verify that <math> M^* </math> is a matroid and that the dual of <math> M^* </math> is <math> M</math>.<ref name=Whi8632>{{harvp|White|1986|p=32}}</ref>

The dual can be described equally well in terms of other ways to define a matroid. For instance:

* A set is independent in <math>M^*</math> if and only if its complement spans <math>M</math>. 

* A set is a circuit of <math>M^*</math> if and only if its complement is a coatom in <math>M</math>. 

* The rank function of the dual is <math> r^*(S) = |S| - r(M) + r\left(E\smallsetminus S\right)</math>. 

According to a matroid version of [[Kuratowski's theorem]], the dual of a graphic matroid <math> M </math> is a graphic matroid if and only if <math> M </math> is the matroid of a [[planar graph]]. In this case, the dual of <math> M </math> is the matroid of the [[dual graph]] of <math> G</math>.<ref name=Whi86105>{{harvp|White|1986|p=105}}</ref> The dual of a vector matroid representable over a particular field <math> F </math> is also representable over <math> F</math>. The dual of a transversal matroid is a strict gammoid and vice versa.

;Example: The cycle matroid of a graph is the dual matroid of its bond matroid.

===Minors===
{{main|Matroid minor}}
If ''M'' is a matroid with element set ''E'', and ''S'' is a subset of ''E'', the ''restriction'' of ''M'' to ''S'', written ''M''&nbsp;|''S'', is the matroid on the set ''S'' whose independent sets are the independent sets of ''M'' that are contained in ''S''.  Its circuits are the circuits of ''M'' that are contained in ''S'' and its rank function is that of ''M'' restricted to subsets of ''S''.

In linear algebra, this corresponds to restricting to the subspace generated by the vectors in ''S''.  Equivalently if ''T'' = ''M''−''S'' this may be termed the ''deletion'' of ''T'', written ''M''\''T'' or ''M''−''T''. The submatroids of ''M'' are precisely the results of a sequence of deletions: the order is irrelevant.<ref name=Whi86131>{{harvp|White|1986|p=131}}</ref><ref name=Whi86224>{{harvp|White|1986|p=224}}</ref>

The dual operation of restriction is contraction.<ref name=Whi866139>{{harvp|White|1986|p=139}}</ref> If ''T'' is a subset of ''E'', the ''contraction'' of ''M'' by ''T'', written ''M''/''T'', is the matroid on the underlying set ''E &minus; T'' whose rank function is <math>r'(A) = r(A \cup T) - r(T)</math>.<ref name=Whi86140>{{harvp|White|1986|p=140}}</ref>  In linear algebra, this corresponds to looking at the quotient space by the linear space generated by the vectors in ''T'', together with the images of the vectors in ''E - T''.

A matroid ''N'' that is obtained from ''M'' by a sequence of restriction and contraction operations is called a [[matroid minor|minor]] of ''M''.<ref name=Whi86224/><ref name=Whi86150>{{harvp|White|1986|p=150}}</ref>  We say ''M'' ''contains'' ''N'' ''as a minor''. Many important families of matroids may be characterized by the [[minimal element|minor-minimal]] matroids that do not belong to the family; these are called ''forbidden'' or ''excluded minors''.<ref name=Whi861467>{{harvp|White|1986|pp=146–147}}</ref>

===Sums and unions===
Let ''M'' be a matroid with an underlying set of elements ''E'', and let ''N'' be another matroid on an underlying set ''F''.
The ''direct sum'' of matroids ''M'' and ''N'' is the matroid whose underlying set is the [[disjoint union]] of ''E'' and ''F'', and whose independent sets are the disjoint unions of an independent set of ''M'' with an independent set of ''N''.

The ''union'' of ''M'' and ''N'' is the matroid whose underlying set is the union (not the disjoint union) of ''E'' and ''F'', and whose independent sets are those subsets that are the union of an independent set in ''M'' and one in ''N''. Usually the term "union" is applied when ''E'' = ''F'', but that assumption is not essential.  If ''E'' and ''F'' are disjoint, the union is the direct sum.

== Additional terms <span class="anchor" id="Additional_terms_anchor></span> == <!--Linked to by [[Simple matroid]] (redirect)-->
Let ''M'' be a matroid with an underlying set of elements ''E''.

* ''E'' may be called the ''ground set'' of ''M''.  Its elements may be called the ''points'' of ''M''.

* A subset of ''E'' ''spans'' ''M'' if its closure is ''E''.  A set is said to ''span'' a closed set ''K'' if its closure is ''K''.

* The [[matroid girth|girth]] of a matroid is the size of its smallest circuit or dependent set.

* An element that forms a single-element circuit of ''M'' is called a ''loop''. Equivalently, an element is a loop if it belongs to no basis.<ref name=Ox13/><ref name=Wh86130>{{harvp|White|1986|p=130}}</ref>

* An element that belongs to no circuit is called a ''coloop'' or ''isthmus''. Equivalently, an element is a coloop if it belongs to every basis.

: Loop and coloops are mutually dual.<ref name=Wh86130/>

* If a two-element set {''f, g''} is a circuit of ''M'', then ''f'' and ''g'' are ''parallel'' in ''M''.<ref name=Ox13/>

* A matroid is called ''simple'' if it has no circuits consisting of 1 or 2&nbsp;elements. That is, it has no loops and no parallel elements. The term ''combinatorial geometry'' is also used.<ref name=Ox13>{{harvp|Oxley|1992|p=13}}</ref>  A simple matroid obtained from another matroid ''M'' by deleting all loops and deleting one element from each 2-element circuit until no 2&nbsp;element circuits remain is called a ''simplification'' of ''M''.<ref name=Ox52>{{harvp|Oxley|1992|p=52}}</ref> A matroid is ''co-simple'' if its dual matroid is simple.<ref name=Ox347>{{harvp|Oxley|1992|p=347}}</ref>

* A union of circuits is sometimes called a ''cycle'' of ''M''. A cycle is therefore the complement of a flat of the dual matroid.  (This usage conflicts with the common meaning of "cycle" in graph theory.)

* A ''separator'' of ''M'' is a subset ''S'' of ''E'' such that <math>r(S) + r(E-S) = r(M)</math>. A ''proper'' or ''non-trivial separator'' is a separator that is neither ''E'' nor the empty set.<ref name=Ox128>{{harvp|Oxley|1992|p=128}}</ref> An ''irreducible separator'' is a non-empty separator that contains no other non-empty separator. The irreducible separators partition the ground set ''E''.

* A matroid that cannot be written as the direct sum of two nonempty matroids, or equivalently that has no proper separators, is called ''connected'' or ''irreducible''. A matroid is connected if and only if its dual is connected.<ref name=Wh86110>{{harvp|White|1986|p=110}}</ref>

* A maximal irreducible submatroid of ''M'' is called a ''component'' of ''M''. A component is the restriction of ''M'' to an irreducible separator, and contrariwise, the restriction of ''M'' to an irreducible separator is a component. A separator is a union of components.<ref name=Ox128/>

* A matroid ''M'' is called a ''frame matroid'' if it, or a matroid that contains it, has a basis such that all the points of ''M'' are contained in the lines that join pairs of basis elements.<ref>{{harvp|Zaslavsky|1994}}</ref>

* A matroid is called a [[paving matroid]] if all of its circuits have size at least equal to its rank.<ref name=Ox26>{{harvp|Oxley|1992|p=26}}</ref>

* The [[matroid polytope|basis polytope]] <math>P_M</math> is the [[convex hull]] of the [[indicator vector]]s of the bases of <math>M</math>

* The independence polytope of <math>M</math> is the [[convex hull]] of the [[indicator vector]]s of the independent sets of <math>M</math>.

==Algorithms==
Several important combinatorial optimization problems can be solved efficiently on every matroid. In particular:

* Finding a '''maximum-weight independent set in a [[weighted matroid]]''' can be solved by a [[greedy algorithm]]. This fact may even be used to characterize matroids: if a family ''F'' of sets, closed under taking subsets, has the property that, no matter how the sets are weighted, the greedy algorithm finds a maximum-weight set in the family, then ''F'' must be the family of independent sets of a matroid.<ref name="Ox64">{{harvp|Oxley|1992|p=64}}</ref>

* The '''[[matroid partitioning]] problem''' is to partition the elements of a matroid into as few independent sets as possible, and the '''matroid packing problem''' is to find as many disjoint spanning sets as possible. Both can be solved in polynomial time, and can be generalized to the problem of computing the rank or finding an independent set in a matroid sum.

* A '''[[matroid intersection]]''' of two or more matroids on the same ground set is the family of sets that are simultaneously independent in each of the matroids. The problem of finding the largest set, or the maximum weighted set, in the intersection of two matroids can be found in [[polynomial time]], and provides a solution to many other important combinatorial optimization problems. For instance, [[maximum matching]] in [[bipartite graph]]s can be expressed as a problem of intersecting two [[partition matroid]]s. However, finding the largest set in an intersection of three or more matroids is [[NP-complete]].

== Matroid software ==
Two standalone systems for calculations with matroids are Kingan's [http://userhome.brooklyn.cuny.edu/skingan/software.html Oid] and Hlineny's [http://www.fi.muni.cz/~hlineny/MACEK/ Macek]. Both of them are open-sourced packages. "Oid" is an interactive, extensible software system for experimenting with matroids. "Macek" is a specialized software system with tools and routines for reasonably efficient combinatorial computations with representable matroids.

Both open source mathematics software systems [[SageMath|SAGE]] and [[Macaulay2]] contain matroid packages. [[Maple (software)|Maple]] has a package for dealing with matroids since the version 2024.<ref>{{cite web|url=https://www.maplesoft.com/products/maple/new_features/Maple2024/PDFs/Maple2024-MatroidsHypergraphs.pdf|title=The Matroids and Hypergraphs Packages in Maple 2024|publisher=MapleSoft|access-date=2024-08-19}}</ref>

==Polynomial invariants==
There are two especially significant polynomials associated to a finite matroid ''M'' on the ground set ''E''.  Each is a ''matroid invariant'', which means that isomorphic matroids have the same polynomial.

===Characteristic polynomial===
The ''[[characteristic polynomial]]'' of ''M'' – sometimes called the ''chromatic polynomial'',<ref name=Wh87127/> although it does not count colorings – is defined to be
:<math>p_M(\lambda) := \sum_{S \subseteq E} (-1)^{|S|}\lambda^{r(E)-r(S)},</math>
or equivalently (as long as the empty set is closed in ''M'') as
:<math>p_M(\lambda) := \sum_{A} \mu(\emptyset,A) \lambda^{r(E)-r(A)} </math>,
where μ denotes the [[Möbius function (combinatorics)|Möbius function]] of the [[geometric lattice]] of the matroid and the sum is taken over all the flats A of the matroid.<ref name=Wh87120>{{harvp|White|1987|p=120}}</ref>

* When ''M'' is the cycle matroid ''M''(''G'') of a graph ''G'', the characteristic polynomial is a slight transformation of the [[chromatic polynomial]], which is given by χ<sub>''G''</sub>&nbsp;(λ) = λ<sup>c</sup>''p''<sub>''M''(''G'')</sub>&nbsp;(λ), where ''c'' is the number of connected components of ''G''.

* When ''M'' is the bond matroid ''M''*(''G'') of a graph ''G'', the characteristic polynomial equals the [[Tutte polynomial#Flow polynomial|flow polynomial]] of ''G''.

* When ''M'' is the matroid ''M''(''A'') of an [[Arrangement of hyperplanes|arrangement]] ''A'' of linear hyperplanes in {{math|ℝ{{sup|n}}}} (or ''F''<sup>''n''</sup> where ''F'' is any field), the characteristic polynomial of the arrangement is given by ''p''<sub>''A''</sub>&nbsp;(λ) = λ<sup>''n''&minus;''r''(''M'')</sup>''p''<sub>''M''</sub>&nbsp;(λ).

====Beta invariant====
The ''beta invariant'' of a matroid, introduced by [[Henry Crapo (mathematician)|Crapo]] (1967), may be expressed in terms of the characteristic polynomial <math> p </math> as an evaluation of the derivative<ref name=Wh87123>{{harvp|White|1987|p=123}}</ref>
:<math> \beta(M) = (-1)^{r(M)-1} p_M'(1) </math>
or directly as<ref name=Wh87124>{{harvp|White|1987|p=124}}</ref>
:<math> \beta(M) = (-1)^{r(M)} \sum_{X \subseteq E} (-1)^{|X|} r(X)</math>.
The beta invariant is non-negative, and is zero if and only if <math> M </math> is disconnected, or empty, or a loop.  Otherwise it depends only on the lattice of flats of <math> M</math>. If <math> M </math> has no loops and coloops then <math> \beta( M ) = \beta( M^* )</math>.<ref name=Wh87124/>

===Whitney numbers===
The ''Whitney numbers of the first kind'' of <math> M </math> are the coefficients of the powers of <math>\lambda</math> in the characteristic polynomial. Specifically, the <math>i</math>th Whitney number <math> w_i(M) </math> is the coefficient of <math>\lambda^{r(M)-i}</math> and is the sum of Möbius function values:
:<math>w_i(M) = \sum \{ \mu(\emptyset,A): r(A) = i \},</math>
summed over flats of the right rank. These numbers alternate in sign, so that <math>(-1)^i w_i(M) > 0</math> for <math>0 \leq i \leq r(M)</math>.

The ''Whitney numbers of the second kind'' of <math> M </math> are the numbers of flats of each rank. That is, <math> W_i(M) </math> is the number of rank&nbsp;<math>i</math> flats.

The Whitney numbers of both kinds generalize the [[Stirling number]]s of the first and second kind, which are the Whitney numbers of the cycle matroid of the [[complete graph]], and equivalently of the [[Partition of a set#Refinement_of_partitions|partition lattice]]. They were named after [[Hassler Whitney]], the (co)founder of matroid theory, by [[Gian-Carlo Rota]]. The name has been extended to the similar numbers for finite ranked [[partially ordered set]]s.

===Tutte polynomial===
The ''[[Tutte polynomial]]'' of a matroid, <math> T_M(x, y)</math>, generalizes the characteristic polynomial to two variables. This gives it more combinatorial interpretations, and also gives it the duality property
:<math> T_{M^*}(x,y) = T_M(y,x)</math>,
which implies a number of dualities between properties of <math> M </math> and properties of <math> M^*</math>. One definition of the Tutte polynomial is
:<math> T_M(x,y) = \sum_{S \subseteq E} (x-1)^{ r(M) - r(S) }\ (y-1)^{ |S| - r(S) }</math>.

This expresses the Tutte polynomial as an evaluation of the ''co-rank-nullity'' or ''rank generating polynomial'',<ref name=Wh87126>{{harvp|White|1987|p=126}}</ref>
:<math> R_M(u,v) = \sum_{S\subseteq E} u^{r(M)-r(S)}v^{|S| - r(S)}</math>.
From this definition it is easy to see that the characteristic polynomial is, up to a simple factor, an evaluation of <math> T_M</math>, specifically, 
:<math> p_M(\lambda) = (-1)^{r(M)} T_M(1-\lambda,0)</math>.

Another definition is in terms of internal and external activities and a sum over bases, reflecting the fact that <math> T(1,1) </math> is the number of bases.<ref name=Wh92188>{{harvp|White|1992b|p=188}}</ref> This, which sums over fewer subsets but has more complicated terms, was Tutte's original definition.

There is a further definition in terms of recursion by deletion and contraction.<ref name=Wh86260>{{harvp|White|1986|p=260}}</ref> The deletion-contraction identity is
:<math> F(M) = F( M - e ) + F( M / e ) </math>
when <math> e </math> is neither a loop nor a coloop.
An invariant of matroids (i.e., a function that takes the same value on isomorphic matroids) satisfying this recursion and the multiplicative condition
:<math> F(M \oplus M') = F(M) F(M')</math>
is said to be a ''Tutte-Grothendieck invariant''.<ref name=Wh87126/> The Tutte polynomial is the most general such invariant; that is, the Tutte polynomial is a Tutte-Grothendieck invariant and every such invariant is an evaluation of the Tutte polynomial.<ref name=Wh87127>{{harvp|White|1987|p=127}}</ref>

The [[Tutte polynomial]] <math> T_G </math> of a graph is the Tutte polynomial <math> T_{ M(G) } </math> of its cycle matroid.

== Infinite matroids ==
<!-- [[Infinite matroid]] redirects here. -->
The theory of infinite matroids is much more complicated than that of finite matroids and forms a subject of its own.  For a long time, one of the difficulties has been that there were many reasonable and useful definitions, none of which appeared to capture all the important aspects of finite matroid theory.  For instance, it seemed to be hard to have bases, circuits, and duality together in one notion of infinite matroids.

The simplest definition of an infinite matroid is to require ''finite rank''; that is, the rank of ''E'' is finite.  This theory is similar to that of finite matroids except for the failure of duality due to the fact that the dual of an infinite matroid of finite rank does not have finite rank.  Finite-rank matroids include any subsets of finite-dimensional vector spaces and of [[Field (mathematics)|field extensions]] of finite [[transcendence degree]].

The next simplest infinite generalization is finitary matroids, also known as [[Pregeometry (model theory)|pregeometries]]. A matroid with possibly infinite ground set is ''finitary'' if it has the property that

:<math>x \in \operatorname{cl}(Y)\  \Leftrightarrow \ \text{ there is a finite set } Y' \subseteq Y \text{ such that } x \in  \operatorname{cl}(Y').</math>

Equivalently, every dependent set contains a finite dependent set.

Examples are linear dependence of arbitrary subsets of infinite-dimensional [[vector space]]s (but not infinite dependencies as in [[Hilbert space|Hilbert]] and [[Banach space]]s), and algebraic dependence in arbitrary subsets of field extensions of possibly infinite transcendence degree. Again, the class of finitary matroid is not self-dual, because the dual of a finitary matroid is not finitary.

Finitary infinite matroids are studied in [[model theory]], a branch of [[mathematical logic]] with strong ties to [[algebra]].

In the late 1960s matroid theorists asked for a more general notion that shares the different aspects of finite matroids and generalizes their duality. Many notions of infinite matroids were defined in response to this challenge, but the question remained open. One of the approaches examined by D.A. Higgs became known as ''B-matroids'' and was studied by Higgs, Oxley, and others in the 1960s and 1970s. According to a recent result by {{harvp|Bruhn|Diestel|Kriesell|Pendavingh|2013}}, it solves the problem: Arriving at the same notion independently, they provided five equivalent systems of axiom—in terms of independence, bases, circuits, closure and rank. The duality of B-matroids generalizes dualities that can be observed in infinite graphs.

The independence axioms are as follows:

# The empty set is independent.
# Every subset of an independent set is independent.
# For every [[maximal element|nonmaximal]] (under set inclusion) independent set <math>I</math> and maximal independent set <math>J</math>, there is <math>x \in J \smallsetminus I</math> such that <math>I \cup \{x\}</math> is independent.
# For every subset <math>X</math> of the base space, every independent subset <math>I</math> of <math>X</math> can be extended to a maximal independent subset of <math>X</math>.

With these axioms, every matroid has a dual.

==History==
Matroid theory was introduced by {{harvp|Whitney|1935}}. It was also independently discovered by [[Takeo Nakasawa]], whose work was forgotten for many years ({{harvp|Nishimura|Kuroda|2009}}).

In his seminal paper, Whitney provided two axioms for independence, and defined any structure adhering to these axioms to be "matroids".{{efn|
Although it was perhaps implied, {{harvp|Whitney|1935}} did not include an axiom requiring at least one subset to be independent.
:
}}
His key observation was that these axioms provide an abstraction of "independence" that is common to both graphs and matrices.
Because of this, many of the terms used in matroid theory resemble the terms for their analogous concepts in [[linear algebra]] or [[graph theory]].

Almost immediately after Whitney first wrote about matroids, an important article was written by {{harvp|MacLane|1936}} on the relation of matroids to [[projective geometry]]. A year later, {{harvp|van der Waerden|1937}} noted similarities between algebraic and linear dependence in his classic textbook on Modern Algebra.

In the 1940s [[Richard Rado]] developed further theory under the name "independence systems" with an eye towards [[Transversal (combinatorics)|transversal theory]], where his name for the subject is still sometimes used.

In the 1950s [[W. T. Tutte|W.T. Tutte]] became the foremost figure in matroid theory, a position he retained for many years. His contributions were plentiful, including
* the characterization of [[binary matroid|binary]], [[regular matroid|regular]], and [[graphic matroid|graphic]] matroids by [[Matroid minor|excluded minors]]

* the regular-matroid representability theorem

* the theory of chain groups and their matroids

and the tools he used to prove many of his results:

* the "Path theorem"

* "[[Tutte homotopy theorem]]" (see, e.g., {{harvp|Tutte|1965}})

which are so complicated that later theorists have gone to great trouble to eliminate the need for them in proofs.{{efn|
A fine example is [[A. M. H. Gerards|A.M.H. Gerards']] short proof ({{harvp|Gerards|1989}}) of Tutte's characterization of regular matroids.
}}

{{harvp|Crapo|1969}} and {{harvp|Brylawski|1972}} generalized to matroids Tutte's "dichromate", a graphic polynomial now known as the [[Tutte polynomial]] (named by Crapo).  Their work has recently (especially in the 2000s) been followed by a flood of papers&mdash;though not as many as on the Tutte polynomial of a graph.

In 1976 [[Dominic Welsh]] published the first comprehensive book on matroid theory.

[[Paul Seymour (mathematician)|Paul Seymour]]'s decomposition theorem for regular matroids ({{harvp|Seymour|1980}}) was the most significant and influential work of the late 1970s and the 1980s.
Another fundamental contribution, by {{harvp|Kahn|Kung|1982}}, showed why projective geometries and [[Dowling geometry|Dowling geometries]] play such an important role in matroid theory.

By the 1980s there were many other important contributors, but one should not omit to mention [[Geoff Whittle]]'s extension to ternary matroids of Tutte's characterization of binary matroids that are representable over the rationals {{harv|Whittle|1995}}, perhaps the biggest single contribution of the 1990s.

In the current period (since around 2000) the Matroid Minors Project of [[Jim Geelen|Geelen]], Gerards, Whittle, and others,{{efn|
The Matroid Minors Project is an attempt to duplicate, for matroids that are representable over a finite field, the success of the Robertson–Seymour Graph Minors Project (see [[Robertson–Seymour theorem]]).
}}
has produced substantial advances in the structure theory of matroids. Many others have also contributed to that part of matroid theory, which (in the first and second decades of the 21st&nbsp;century) is flourishing.

==Researchers==
Mathematicians who pioneered the study of matroids include
{{div col begin |colwidth=12em}}
: Susumu Kuroda<ref name=Nishimura-Kuroda-2009>{{harvp|Nishimura|Kuroda|2009}}</ref>
: [[Saunders Mac Lane|Saunders MacLane]]
: [[Richard Rado]]
: [[Takeo Nakasawa]]
: Hirokazu Nishimura<ref name=Nishimura-Kuroda-2009/>
: [[W. T. Tutte|William T. Tutte]]
: [[Bartel Leendert van der Waerden|Bartel L. van der Waerden]]
: [[Hassler Whitney]]
{{div col end}}

Some of the other major contributors are
{{div col begin|colwidth=12em}}
: [[Jack Edmonds]]
: [[Jim Geelen]]
: [[Eugene Lawler]]
: [[László Lovász]]
: [[Gian-Carlo Rota]]
: [[Paul Seymour (mathematician)|Paul D. Seymour]]
: [[Dominic Welsh]]
{{div col end}}

== Footnotes ==
{{notelist}}

== See also ==
* {{annotated link|Antimatroid}} with antiexchange axiom
* {{annotated link|Coxeter matroid}}
* {{annotated link|Greedoid}}
* {{annotated link|Oriented matroid}}
* {{annotated link|Polymatroid}}
* {{annotated link|Pregeometry (model theory)}}

== Citations ==
{{reflist|20em}}

== References ==
{{refbegin|colwidth=25em|small=yes}}

* {{cite journal
 | last1 = Bruhn    | first1 = Henning       | last2 = Diestel    | first2 = Reinhard
 | last3 = Kriesell | first3 = Matthias      | last4 = Pendavingh | first4 = Rudi
 | last5 = Wollan   | first5 = Paul
 | year = 2013
 | title = Axioms for infinite matroids
 | journal = [[Advances in Mathematics]]
 | volume = 239  | pages = 18–46
 | doi = 10.1016/j.aim.2013.01.011 | doi-access = free
 | arxiv = 1003.3919  | mr = 3045140  | s2cid = 10436077
 }} 
* {{cite book
 |last1=Bryant  |first1=Victor
 |last2=Perfect |first2=Hazel   |author2-link=Hazel Perfect
 |year=1980
 |title=Independence Theory in Combinatorics
 |title-link=Independence Theory in Combinatorics
 |publisher=Chapman and Hall
 |location=London, UK & New York, NY
 |isbn=978-0-412-22430-0
}} 
* {{cite journal
 |last=Brylawski |first=Thomas H.  |author-link=Thomas H. Brylawski
 |year=1972
 |title=A decomposition for combinatorial geometries
 |journal=[[Transactions of the American Mathematical Society]]
 |volume=171  |pages=235–282
 |doi=10.2307/1996381 |doi-access=free
 |jstor=1996381
}}
* {{cite journal
 |last=Crapo |first=Henry H.  |author-link=Henry Crapo (mathematician)
 |year=1969
 |title=The Tutte polynomial
 |journal=[[Aequationes Mathematicae]]
 |volume=3  |issue=3  |pages=211–229
 |doi=10.1007/BF01817442  |s2cid=119602825
}}
* {{cite book
 |last1=Crapo |first1=Henry H.     |author-link1=Henry Crapo (mathematician)
 |last2=Rota  |first2=Gian-Carlo  |author2-link=Gian-Carlo Rota
 |year=1970
 |title=On the Foundations of Combinatorial Theory: Combinatorial geometries
 |publisher=M.I.T. Press
 |location=Cambridge, MA
 |isbn=978-0-262-53016-3 |mr=0290980
 |url=https://archive.org/details/onfoundationsofc00crap
 |via=[[Internet Archive]] (archive.org)
}}
* {{cite conference
 |last=Edmonds |first=Jack  |author-link=Jack Edmonds
 |date=5–9 March 2001
 |title=Submodular functions, matroids, and certain polyhedra
 |editor1-last=Jünger  |editor1-first=Michael
 |editor2-last=Reinelt |editor2-first=Gerhard
 |editor3-last=Rinaldi |editor3-first=Giovanni
 |publication-date=2003
 |book-title=Combinatorial Optimization — Eureka, You Shrink!: Papers dedicated to Jack Edmonds
 |conference=5th International Workshop
 |place=Aussois, FR |edition=revised papers
 |series=Lecture Notes in Computer Science |volume=2570
 |pages=11–26
 |publisher=Berlin, Heidelberg: Springer |lang=en
 |doi=10.1007/3-540-36478-1_2 |isbn=978-3-540-36478-8|citeseerx=10.1.1.454.4060
 }}
*{{cite journal
 | last1 = Geelen | first1 = J. F.
 | last2 = Gerards | first2 = A. M. H.
 | last3 = Kapoor | first3 = A.
 | doi = 10.1006/jctb.2000.1963
 | issue = 2
 | journal = Journal of Combinatorial Theory
 | mr = 1769191
 | pages = 247–299
 | series = Series B
 | title = The excluded minors for GF(4)-representable matroids
 | volume = 79
 | year = 2000}}
* {{cite book
 |last1=Geelen  |first1=Jim    |author1-link=Jim Geelen
 |last2=Gerards |first2=A.M.H.
 |last3=Whittle |first3=Geoff 
 |year=2007
 |contribution=Towards a matroid-minor structure theory
 |editor1=Grimmett, Geoffrey   |display-editors=etal
 |title=Combinatorics, Complexity, and Chance: A tribute to Dominic Welsh
 |series=Oxford Lecture Series in Mathematics and its Applications |volume=34
 |pages=72–82
 |publisher=Oxford University Press
 |location=Oxford, UK
}}
* {{cite journal
 |last=Gerards |first=A.M.H.
 |year=1989
 |title=A short proof of Tutte's characterization of totally unimodular matrices
 |journal=[[Linear Algebra and Its Applications]]
 |volume=114-115 |pages=207–212
 |doi=10.1016/0024-3795(89)90461-8  |doi-access=free
}}
* {{cite journal
 |last1=Kahn |first1=Jeff
 |last2=Kung |first2=Joseph P.S.
 |year=1982
 |title=Varieties of combinatorial geometries
 |journal=[[Transactions of the American Mathematical Society]]
 |volume=271  |issue=2  |pages=485–499
 |doi=10.2307/1998894  |doi-access=free
 |jstor=1998894
}}
* {{cite book
 |last1=Kingan |first1=Robert
 |last2=Kingan |first2=Sandra
 |year=2005
 |contribution=A software system for matroids
 |title=Graphs and Discovery
 |series=DIMACS Series in Discrete Mathematics and Theoretical Computer Science
 |pages=287–296
}}
* {{cite report
 |last1=Kashyap  |first1=Navin
 |last2=Soljanin |first2=Emina
 |last3=Vontobel |first3=Pascal
 |year=2009
 |title=Applications of matroid theory and combinatorial optimization to information and coding theory
 |url=https://www.birs.ca/workshops/2009/09w5103/report09w5103.pdf
 |via=www.birs.ca  |access-date=4 October 2014
}}
* {{cite book
 |editor-last=Kung |editor-first=Joseph P.S.
 |year=1986
 |title=A Source Book in Matroid Theory
 |publisher=Birkhäuser
 |location=Boston, MA
 |isbn=978-0-8176-3173-4
 |mr=0890330  |doi=10.1007/978-1-4684-9199-9
 |url=https://archive.org/details/sourcebookinmatr0000kung
 |via=[[Internet Archive]] (archive.org)
}}
* {{cite journal
 |last=MacLane |first=Saunders |author-link=Saunders Mac Lane
 |year=1936
 |title=Some interpretations of abstract linear dependence in terms of projective geometry
 |journal=[[American Journal of Mathematics]]
 |volume=58  |issue=1  |pages=236–240
 |doi=10.2307/2371070  |jstor=2371070
}}
* {{cite journal
 |last=Minty |first=George J.
 |year=1966
 |title=On the axiomatic foundations of the theories of directed linear graphs, electrical networks and network-programming
 |journal=[[Journal of Mathematics and Mechanics]]
 |volume=15  |pages=485–520
 |mr=0188102
}}
* {{cite journal
 |last1=Neel |first1=David L.
 |last2=Neudauer |first2=Nancy A. |author2-link=Nancy Neudauer
 |year=2009
 |title=Matroids you have known
 |journal=[[Mathematics Magazine]]
 |volume=82  |issue=1  |pages=26–41
 |doi=10.4169/193009809x469020
 |url=http://www.maa.org/sites/default/files/pdf/shortcourse/2011/matroidsknown.pdf
 |access-date=4 October 2014 |via=[[Mathematical Association of America]] (maa.org)
}}
* {{cite book
 |editor1-first=Hirokazu |editor1-last=Nishimura
 |editor2-first=Susumu   |editor2-last=Kuroda
 |year=2009
 |title=A lost mathematician, Takeo Nakasawa: The forgotten father of matroid theory
 |publisher= Birkhäuser Verlag |place=Basel, CH
 |isbn=978-3-7643-8572-9
 |mr=2516551 |zbl=1163.01001
 |doi=10.1007/978-3-7643-8573-6
}}
* {{cite book
 |last=Oxley |first=James  |author-link=James Oxley
 |year=1992
 |title=Matroid Theory
 |publisher=Oxford University Press
 |location=Oxford, UK
 |isbn=978-0-19-853563-8
 |mr=1207587 |zbl=0784.05002
}}
* {{cite book
 |last=Recski |first=András
 |year=1989
 |title=Matroid Theory and its Applications in Electric Network Theory and in Statics
 |series=Algorithms and Combinatorics  |volume=6
 |publisher=Springer-Verlag and Akademiai Kiado
 |location=Berlin, DE & Budapest, HU
 |isbn=978-3-540-15285-9
 |doi=10.1007/978-3-662-22143-3
 |s2cid=117772439  |mr=1027839
 |url=https://archive.org/details/matroidtheoryits0000recs
 |url-access=registration |via=[[Internet Archive]] (archive.org)
}} 
* {{eom
 |last=Sapozhenko |first=A.A.
 |id=M/m062870
}}
* {{cite journal
 |last=Seymour |first=Paul D. |author-link=Paul Seymour (mathematician)
 |year=1980
 |title=Decomposition of regular matroids
 |journal=[[Journal of Combinatorial Theory]]
 | series=Series&nbsp;B  |volume=28  |issue=3 |pages=305–359
 |doi=10.1016/0095-8956(80)90075-1 |doi-access=free
 |hdl=10338.dmlcz/101946 |hdl-access=free
 |zbl=0443.05027
}}
* {{cite book
 |last=Truemper |first=Klaus
 |year=1992
 |title=Matroid Decomposition
 |publisher=Academic Press
 |location=Boston, MA
 |isbn=978-0-12-701225-4
 |mr=1170126
 |url=http://www.emis.de/monographs/md/index.html
 |via=emis.de
}}
* {{cite journal
 |last=Tutte |first=W.T. |author-link=W. T. Tutte
 |year=1959
 |title=Matroids and graphs
 |journal=[[Transactions of the American Mathematical Society]]
 |volume=90  |issue=3  |pages=527–552
 |doi=10.2307/1993185 |doi-access=free
 |mr=0101527  |jstor=1993185
}}
* {{cite journal
 |last=Tutte |first=W.T. |author-link=W. T. Tutte
 |year=1965
 |title=Lectures on matroids
 |journal=Journal of Research of the National Bureau of Standards
 |series=Section&nbsp;B  |volume=69  |pages=1–47
}}
* {{cite book
 | last=Tutte | first=W.T. | author-link=W. T. Tutte
 | year=1971 
 | title=Introduction to the Theory of Matroids
 | series=Modern Analytic and Computational Methods in Science and Mathematics | volume=37
 | location=New York, NY
 | publisher=American Elsevier Publishing Company
 | zbl=0231.05027
}}
* {{cite journal
 |last=Vámos |first=Peter
 |year=1978
 |title=The missing axiom of matroid theory is lost forever
 |journal=[[Journal of the London Mathematical Society]]
 |volume=18  |issue=3  |pages=403–408
 |doi=10.1112/jlms/s2-18.3.403
}}
* {{cite book
 |last=van der Waerden |first=B.L. |author-link=Bartel Leendert van der Waerden
 |year=1937
 |title=Moderne Algebra
}}
* {{cite book
 |last=Welsh |first=D.J.A.
 |year=1976
 |title=Matroid Theory
 |series=L.M.S. Monographs |volume=8
 |publisher=Academic Press
 |isbn=978-0-12-744050-7
 |zbl=0343.05002
}}
* {{cite book
 |author=
 |year=1986
 |title=Theory of Matroids
 |editor-last=White |editor-first=Neil
 |series=Encyclopedia of Mathematics and its Applications |volume=26
 |publisher=Cambridge University Press
 |location=Cambridge, UK
 |isbn=978-0-521-30937-0 |zbl=0579.00001
 |url=https://archive.org/details/theoryofmatroids1986unse
 |url-access=registration |via=[[Internet Archive]] (archive.org)
}}
* {{cite book
 | author=
 | year=1987
 | title=Combinatorial Geometries
 | editor-last=White | editor-first=Neil
 | series=Encyclopedia of Mathematics and its Applications | volume=29
 | location=Cambridge, UK
 | publisher=[[Cambridge University Press]]
 | isbn=978-0-521-33339-9 | zbl=0626.00007
 | url=https://archive.org/details/combinatorialgeo0000unse
 | url-access=registration |via=[[Internet Archive]] (archive.org)
}}
* {{cite book
 |author=
 |year=1992a
 |title=Matroid Applications
 |editor-last=White |editor-first=Neil
 |series=Encyclopedia of Mathematics and its Applications  |volume=40
 |publisher=Cambridge University Press
 |location=Cambridge, UK
 |isbn=978-0-521-38165-9 |zbl=0742.00052
 |url=https://archive.org/details/matroidapplicati0000unse
 |url-access=registration |via=[[Internet Archive]] (archive.org)
}}
* {{cite journal
 |last=Whitney |first=Hassler |author-link=Hassler Whitney
 |year=1935
 |title=On the abstract properties of linear dependence
 |journal=[[American Journal of Mathematics]]
 |volume=57  |issue=3  |pages=509–533
 |doi=10.2307/2371182  |mr=1507091  |jstor=2371182
 |hdl=10338.dmlcz/100694  |hdl-access=free
}} — Reprinted in {{harvp|Kung|1986|pp=55–79}}
* {{cite journal
 |last=Whittle |first=Geoff
 |year=1995
 |title=A characterization of the matroids representable over ''GF''(3) and the rationals
 |journal=[[Journal of Combinatorial Theory]]
 |series=Series&nbsp;B  |volume=65  |issue=2  |pages=222–261
 |doi=10.1006/jctb.1995.1052 |doi-access=free
}}
* {{cite journal
 | last=Zaslavsky | first=Thomas
 | year=1994
 | title=Frame matroids and biased graphs
 | journal=[[Eur. J. Comb.]]
 | volume=15 | number=3 | pages=303–307
 | issn=0195-6698  | zbl=0797.05027
 | doi=10.1006/eujc.1994.1034 | doi-access=free
}}

{{refend}}

== External links ==
* {{SpringerEOM|title=Matroid}}

* {{cite web
 |last=Kingan |first=Sandra
 |title=Matroid theory
 |website=userhome.brooklyn.cuny.edu
 |type=academic personal site
 |series=[[Brooklyn College]]
 |publisher=[[City University of New York]]  |place=Brooklyn, NY
 |url=http://userhome.brooklyn.cuny.edu/skingan/matroids/
}} — A large bibliography of matroid papers, matroid software, and links.

* {{cite web
 |last=Locke |first=S.C.
 |title=Greedy algorithms
 |type=academic personal site
 |website=math.fau.edu
 |publisher=[[Florida Atlantic University]]  |place=Boca Raton, FL
 |url=http://euler.math.fau.edu/locke/Greedy.htm
}}

* {{cite web
 |last=Pagano |first=Steven R. |title=Matroids and signed graphs
 |type=academic personal site
 |website=math.binghamton.edu
 |publisher=[[Binghamton University]]  |place=Binghamton, NY 
 |url=http://www.math.binghamton.edu/zaslav/Pagano/Matridx.htm
}}

* {{cite web
 |first=Mark |last=Hubenthal
 |title=A brief look at matroids
 |website=math.washington.edu
 |type=academic personal site
 |publisher=[[University of Washington]]  |place=Seattle, WA
 |url=http://www.math.washington.edu/~hubenjm/matroid2.pdf |url-status=dead <!-- presumed -->
 |archive-url=https://web.archive.org/web/20100812232232/http://www.math.washington.edu/~hubenjm/matroid2.pdf 
 |archive-date=2010-08-12 |df=dmy-all
}} — Gives proofs for statements in this article.

* {{cite web
 |first=James |last=Oxley
 |title=What is a matroid?
 |type=academic personal site
 |website=math.lsu.edu
 |publisher=[[Louisiana State University]]
 |place=Baton Rouge, LA
 |url=https://www.math.lsu.edu/~oxley/survey4.pdf
}}

* {{cite book
 |editor-first=Neil |editor-last=White
 |year=1992b
 |title=Matroid Applications
 |publisher=Cambridge University Press
 |isbn=978-0-5213-8165-9 |issn=0953-4806
 |url=https://books.google.com/books?id=uD2H-RAcBpwC&dq=greedoid+theory&pg=PP1
 |via=Google Books
}}

{{Authority control}}

[[Category:Matroid theory| ]]
[[Category:Closure operators]]
[[Category:Families of sets]]