- Algorithms
- >
- Combinatorial algorithms
- >
- Combinatorial optimization
- >
- Matroid theory

- Algorithms
- >
- Search algorithms
- >
- Combinatorial optimization
- >
- Matroid theory

- Category theory
- >
- Duality theories
- >
- Closure operators
- >
- Matroid theory

- Combinatorics
- >
- Combinatorial algorithms
- >
- Combinatorial optimization
- >
- Matroid theory

- Comparison (mathematical)
- >
- Order theory
- >
- Closure operators
- >
- Matroid theory

- Computational mathematics
- >
- Combinatorial algorithms
- >
- Combinatorial optimization
- >
- Matroid theory

- Fields of mathematics
- >
- Discrete mathematics
- >
- Combinatorics
- >
- Matroid theory

- Fields of mathematics
- >
- Discrete mathematics
- >
- Discrete geometry
- >
- Matroid theory

- Fields of mathematics
- >
- Order theory
- >
- Closure operators
- >
- Matroid theory

- Geometry
- >
- Duality theories
- >
- Closure operators
- >
- Matroid theory

- Geometry
- >
- Fields of geometry
- >
- Discrete geometry
- >
- Matroid theory

- Graph theory
- >
- Network theory
- >
- Combinatorial optimization
- >
- Matroid theory

- Homological algebra
- >
- Duality theories
- >
- Closure operators
- >
- Matroid theory

- Manifolds
- >
- Duality theories
- >
- Closure operators
- >
- Matroid theory

- Mathematical analysis
- >
- Mathematical optimization
- >
- Combinatorial optimization
- >
- Matroid theory

- Mathematics
- >
- Fields of mathematics
- >
- Combinatorics
- >
- Matroid theory

- Numerical analysis
- >
- Mathematical optimization
- >
- Combinatorial optimization
- >
- Matroid theory

- Operations research
- >
- Network theory
- >
- Combinatorial optimization
- >
- Matroid theory

- Topology
- >
- General topology
- >
- Closure operators
- >
- Matroid theory

Delta-matroid

In mathematics, a delta-matroid or Δ-matroid is a family of sets obeying an exchange axiom generalizing an axiom of matroids. A non-empty family of sets is a delta-matroid if, for every two sets and i

Geometric 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 lattice without the assumption of finitene

Independence Theory in Combinatorics

Independence Theory in Combinatorics: An Introductory Account with Applications to Graphs and Transversals is an undergraduate-level mathematics textbook on the theory of matroids. It was written by V

Matroid rank

In the mathematical theory of matroids, the rank of a matroid is the maximum size of an independent set in the matroid. The rank of a subset S of elements of the matroid is, similarly, the maximum siz

Sylvester–Gallai theorem

The Sylvester–Gallai theorem in geometry states that every finite set of points in the Euclidean plane has a line that passes through exactly two of the points or a line that passes through all of the

Algebraic matroid

In mathematics, an algebraic matroid is a matroid, a combinatorial structure, that expresses an abstraction of the relation of algebraic independence.

Submodular set function

In mathematics, a submodular set function (also known as a submodular function) is a set function whose value, informally, has the property that the difference in the incremental value of the function

Transcendence degree

In abstract algebra, the transcendence degree of a field extension L / K is a certain rather coarse measure of the "size" of the extension. Specifically, it is defined as the largest cardinality of an

Uniform matroid

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 r. An alternative definition is that every permu

Vámos matroid

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 named after English mathematician , who first des

Hereditary property

In mathematics, a hereditary property is a property of an object that is inherited by all of its subobjects, where the meaning of subobject depends on the context. These properties are particularly co

Ear decomposition

In graph theory, an ear of an undirected graph G is a path P where the two endpoints of the path may coincide, but where otherwise no repetition of edges or vertices is allowed, so every internal vert

Binary matroid

In 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 elements are the columns of a (0,1)-matrix

Graphic matroid

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 forests in a given finite undirected graph. The d

Tutte homotopy theorem

In mathematics, the Tutte homotopy theorem, introduced by Tutte, generalises the concept of "path" from graphs to matroids, and states roughly that closed paths can be written as compositions of eleme

Pseudoforest

In graph theory, a pseudoforest is an undirected graph in which every connected component has at most one cycle. That is, it is a system of vertices and edges connecting pairs of vertices, such that n

MacLane matroid

No description available.

Fano plane

In finite geometry, the Fano plane (after Gino Fano) is a finite projective plane with the smallest possible number of points and lines: 7 points and 7 lines, with 3 points on every line and 3 lines t

Dowling geometry

In combinatorial mathematics, a Dowling geometry, named after Thomas A. Dowling, is a matroid associated with a group. There is a Dowling geometry of each rank for each group. If the rank is at least

K-set (geometry)

In discrete geometry, a -set of a finite point set in the Euclidean plane is a subset of elements of that can be strictly separated from the remaining points by a line. More generally, in Euclidean sp

Branch-decomposition

In graph theory, a branch-decomposition of an undirected graph G is a hierarchical clustering of the edges of G, represented by an unrooted binary tree T with the edges of G as its leaves. Removing an

Basis of a matroid

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 set.

Corank

In mathematics, corank is complementary to the concept of the rank of a mathematical object, and may refer to the dimension of the left nullspace of a matrix, the dimension of the cokernel of a linear

Partition matroid

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 the elements are partitioned into different cat

Matroid parity problem

In combinatorial optimization, the matroid parity problem is a problem of finding the largest independent set of paired elements in a matroid. The problem was formulated by as a common generalization

Eulerian matroid

In matroid theory, an Eulerian matroid is a matroid whose elements can be partitioned into a collection of disjoint circuits.

Free matroid

In mathematics, the free matroid over a given ground-set E is the matroid in which the independent sets are all subsets of E. It is a special case of a uniform matroid. The unique basis of this matroi

Matroid

In combinatorics, a branch of mathematics, a matroid /ˈmeɪtrɔɪd/ is a structure that abstracts and generalizes the notion of linear independence in vector spaces. There are many equivalent ways to def

Antimatroid

In mathematics, an antimatroid is a formal system that describes processes in which a set is built up by including elements one at a time, and in which an element, once available for inclusion, remain

Greedy algorithm

A greedy algorithm is any algorithm that follows the problem-solving heuristic of making the locally optimal choice at each stage. In many problems, a greedy strategy does not produce an optimal solut

Tutte polynomial

The Tutte polynomial, also called the dichromate or the Tutte–Whitney polynomial, is a graph polynomial. It is a polynomial in two variables which plays an important role in graph theory. It is define

Weighted matroid

In combinatorics, a branch of mathematics, a weighted matroid is a matroid endowed with function with respect to which one can perform a greedy algorithm. A weight function for a matroid assigns a str

Matroid girth

In matroid theory, a mathematical discipline, the girth of a matroid is the size of its smallest circuit or dependent set. The cogirth of a matroid is the girth of its dual matroid. Matroid girth gene

Coxeter matroid

In mathematics, Coxeter matroids are generalization of matroids depending on a choice of a Coxeter group W and a parabolic subgroup P. Ordinary matroids correspond to the case when P is a maximal para

Gain graph

A gain graph is a graph whose edges are labelled "invertibly", or "orientably", by elements of a group G. This means that, if an edge e in one direction has label g (a group element), then in the othe

Gammoid

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 paths in a directed graph. The concept of a ga

Circuit rank

In graph theory, a branch of mathematics, the circuit rank, cyclomatic number, cycle rank, or nullity of an undirected graph is the minimum number of edges that must be removed from the graph to break

Matroid-constrained number partitioning

Matroid-constrained number partitioning is a variant of the multiway number partitioning problem, in which the subsets in the partition should be independent sets of a matroid. The input to this probl

Supersolvable arrangement

In mathematics, a supersolvable arrangement is a hyperplane arrangement which has a maximal flag with only modular elements. Equivalently, the intersection semilattice of the arrangement is a supersol

Bicircular matroid

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 sets are the edge sets of pseudoforests of

Biased graph

In mathematics, a biased graph is a graph with a list of distinguished circles (edge sets of simple cycles), such that if two circles in the list are contained in a theta graph, then the third circle

Pregeometry (model theory)

Pregeometry, and in full combinatorial pregeometry, are essentially synonyms for "matroid". They were introduced by Gian-Carlo Rota with the intention of providing a less "ineffably cacophonous" alter

Matroid representation

In the mathematical 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 are analogous

Algebraic independence

In abstract algebra, a subset of a field is algebraically independent over a subfield if the elements of do not satisfy any non-trivial polynomial equation with coefficients in . In particular, a one

Matroid embedding

In combinatorics, a matroid embedding is a set system (F, E), where F is a collection of feasible sets, that satisfies the following properties. 1.
* Accessibility property: Every non-empty feasible

Paving matroid

In the mathematical theory of matroids, a paving matroid is a matroid in which every circuit has size at least as large as the matroid's rank. In a matroid of rank every circuit has size at most , so

Cryptomorphism

In mathematics, two objects, especially systems of axioms or semantics for them, are called cryptomorphic if they are equivalent but not obviously equivalent. In particular, two definitions or axiomat

Matroid partitioning

Matroid partitioning is a problem arising in the mathematical study of matroids and in the design and analysis of algorithms. Its goal is to partition the elements of a matroid into as few independent

Colored matroid

In mathematics, a colored matroid is a matroid whose elements are labeled from a set of colors, which can be any set that suits the purpose, for instance the set of the first n positive integers, or t

Steinitz exchange lemma

The Steinitz exchange lemma is a basic theorem in linear algebra used, for example, to show that any two bases for a finite-dimensional vector space have the same number of elements. The result is nam

Matroid minor

In the mathematical theory of 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 are closely related

Matroid polytope

In mathematics, a matroid polytope, also called a matroid basis polytope (or basis matroid polytope) to distinguish it from other polytopes derived from a matroid, is a polytope constructed via the ba

Ingleton's inequality

In mathematics, Ingleton's inequality is an inequality that is satisfied by the rank function of any representable matroid. In this sense it is a necessary condition for representability of a matroid

Dual matroid

In matroid theory, the dual of a matroid is another matroid that has the same elements as , and in which a set is independent if and only if has a basis set disjoint from it. Matroid duals go back to

Rota's conjecture

Rota's excluded minors conjecture is one of a number of conjectures made by mathematician Gian-Carlo Rota. It is considered to be an important problem by some members of the structural combinatorics c

Whitney's planarity criterion

In mathematics, Whitney's planarity criterion is a matroid-theoretic characterization of planar graphs, named after Hassler Whitney. It states that a graph G is planar if and only if its graphic matro

Sylvester matroid

In matroid theory, a Sylvester matroid is a matroid in which every pair of elements belongs to a three-element circuit (a triangle) of the matroid.

Regular matroid

In mathematics, a regular matroid is a matroid that can be represented over all fields.

Matroid intersection

In combinatorial optimization, the matroid intersection problem is to find a largest common independent set in two matroids over the same ground set. If the elements of the matroid are assigned real w

Rota's basis conjecture

In linear algebra and matroid theory, Rota's basis conjecture is an unproven conjecture concerning rearrangements of bases, named after Gian-Carlo Rota. It states that, if X is either a vector space o

Signed graph

In the area of graph theory in mathematics, a signed graph is a graph in which each edge has a positive or negative sign. A signed graph is balanced if the product of edge signs around every cycle is

Matroid oracle

In mathematics and computer science, a matroid oracle is a subroutine through which an algorithm may access a matroid, an abstract combinatorial structure that can be used to describe the linear depen

Bipartite matroid

In mathematics, a bipartite matroid is a matroid all of whose circuits have even size.

Base-orderable matroid

In 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 and there exists a feasible exchange bijection,

Polymatroid

In mathematics, a polymatroid is a polytope associated with a submodular function. The notion was introduced by Jack Edmonds in 1970. It is also described as the multiset analogue of the matroid.

Rigidity matroid

In the mathematics of structural rigidity, a rigidity matroid is a matroid that describes the number of degrees of freedom of an undirected graph with rigid edges of fixed lengths, embedded into Eucli

© 2023 Useful Links.