matroids, a minor of a matroid M is another matroid N that is obtained from M by a sequence of restriction and contraction operations. Matroid minors...
16 KB (1,995 words) - 04:03, 25 September 2024
In combinatorics, a matroid /ˈmeɪtrɔɪd/ is a structure that abstracts and generalizes the notion of linear independence in vector spaces. There are many...
60 KB (8,774 words) - 11:35, 31 March 2025
In mathematics, an algebraic matroid is a matroid, a combinatorial structure, that expresses an abstraction of the relation of algebraic independence....
6 KB (700 words) - 17:41, 17 June 2022
In mathematics, a uniform matroid is a matroid in which the independent sets are exactly the sets containing at most r elements, for some fixed integer...
7 KB (1,001 words) - 20:19, 1 April 2025
mathematics and computer science, a matroid oracle is a subroutine through which an algorithm may access a matroid, an abstract combinatorial structure...
33 KB (4,287 words) - 21:15, 23 February 2025
In matroid theory, the dual of a matroid M {\displaystyle M} is another matroid M ∗ {\displaystyle M^{\ast }} that has the same elements as M {\displaystyle...
8 KB (972 words) - 19:25, 1 April 2025
Branch-decomposition (category Matroid theory)
matroid of a graph of branchwidth two, so its minimal forbidden minors are the graphic matroid of K4 and the non-graphic matroid U(2,4). The matroids...
21 KB (2,449 words) - 02:47, 16 March 2025
not affect the resulting graph H. Graph minors are often studied in the more general context of matroid minors. In this context, it is common to assume...
35 KB (4,046 words) - 02:37, 30 December 2024
Rota's conjecture (category Matroid theory)
every finite field, the family of matroids that can be represented over that field has only finitely many excluded minors. A proof of the conjecture was...
10 KB (1,208 words) - 09:29, 26 May 2025
In the mathematical theory of matroids, a graphic matroid (also called a cycle matroid or polygon matroid) is a matroid whose independent sets are the...
16 KB (2,283 words) - 19:11, 1 April 2025
In the mathematical subject of matroid theory, the bicircular matroid of a graph G is the matroid B(G) whose points are the edges of G and whose independent...
7 KB (893 words) - 23:53, 2 April 2025
In mathematics, the Vámos matroid or Vámos cube is a matroid over a set of eight elements that cannot be represented as a matrix over any field. It is...
8 KB (1,009 words) - 00:12, 9 November 2024
matroid theory, a binary matroid is a matroid that can be represented over the finite field GF(2). That is, up to isomorphism, they are the matroids whose...
7 KB (825 words) - 00:12, 9 November 2024
An oriented matroid is a mathematical structure that abstracts the properties of directed graphs, vector arrangements over ordered fields, and hyperplane...
31 KB (3,972 words) - 10:04, 27 May 2025
Forbidden graph characterization (redirect from Forbidden minor)
graph minors, a family that is closed under minors always has a finite obstruction set. Erdős–Hajnal conjecture Forbidden subgraph problem Matroid minor Zarankiewicz...
17 KB (1,224 words) - 20:13, 16 April 2025
undergraduate education Minor (graph theory), a relation of one graph to another Minor (matroid theory), a relation of one matroid to another Minor (linear algebra)...
2 KB (279 words) - 04:17, 4 March 2025
In mathematics, a basis of a matroid is a maximal independent set of the matroid—that is, an independent set that is not contained in any other independent...
11 KB (1,639 words) - 06:34, 14 May 2025
{\displaystyle F} . If a matroid is regular, so is its dual matroid, and so is every one of its minors. Every direct sum of regular matroids remains regular....
7 KB (851 words) - 07:14, 30 January 2023
Fano plane (category Matroid theory)
structure theory of matroids. Excluding the Fano plane as a matroid minor is necessary to characterize several important classes of matroids, such as regular...
24 KB (3,102 words) - 07:38, 12 April 2025
Geometric lattice (redirect from Matroid lattice)
In the mathematics of matroids and lattices, a geometric lattice is a finite atomistic semimodular lattice, and a matroid lattice is an atomistic semimodular...
8 KB (1,219 words) - 06:40, 9 May 2025
Wagner's theorem (category Graph minor theory)
configurations) appear in a characterization of the graphic matroids by forbidden matroid minors. Wagner, K. (1937), "Über eine Eigenschaft der ebenen Komplexe"...
8 KB (925 words) - 22:42, 27 February 2025
Biased graph (category Matroid theory)
components. Minors of the frame matroid agree with minors of the biased graph; that is, M(Ω−S) = M(Ω)−S and M(Ω/S) = M(Ω)/S. Frame matroids generalize...
10 KB (1,541 words) - 01:20, 11 January 2025
Hereditary property (redirect from Minor-hereditary property)
hereditary property. For instance, a family that is closed under taking matroid minors may be called "hereditary". In planning and problem solving, or more...
13 KB (1,698 words) - 23:49, 14 April 2025
theory of matroids, a matroid representation is a family of vectors whose linear independence relation is the same as that of a given matroid. Matroid representations...
14 KB (1,784 words) - 00:33, 9 November 2024
Gammoid (category Matroid theory)
In matroid theory, a field within mathematics, a gammoid is a certain kind of matroid, describing sets of vertices that can be reached by vertex-disjoint...
10 KB (1,453 words) - 18:27, 13 May 2025
In mathematics, a partition matroid or partitional matroid is a matroid that is a direct sum of uniform matroids. It is defined over a base set in which...
7 KB (965 words) - 18:08, 30 April 2025
mathematics, a base-orderable matroid is a matroid that has the following additional property, related to the bases of the matroid. For any two bases A {\displaystyle...
8 KB (1,189 words) - 10:29, 11 May 2023
Kapoor for the GF(4) case of Rota's conjecture on matroid minors. Bertrand Guenin for a forbidden minor characterization of the weakly bipartite graphs...
21 KB (1,965 words) - 23:53, 11 August 2024
characteristic polynomial, making it a graph determined by its spectrum. Vámos matroid Weisstein, Eric W. "Diamond Graph". MathWorld. ISGCI: Information System...
3 KB (352 words) - 07:00, 26 June 2022
Pseudoforest (category Matroid theory)
fact, they have at most as many edges as they have vertices) – and their matroid structure allows several other families of sparse graphs to be decomposed...
30 KB (4,054 words) - 00:15, 9 November 2024