Partition Matroid
   HOME
*





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 categories. For each category, there is a ''capacity constraint'' - a maximum number of allowed elements from this category. The independent sets of a partition matroid are exactly the sets in which, for each category, the number of elements from this category is at most the category capacity. Formal definition Let C_i be a collection of disjoint sets ("categories"). Let d_i be integers with 0\le d_i\le , C_i, ("capacities"). Define a subset I\subset \bigcup_i C_i to be "independent" when, for every index i, , I\cap C_i, \le d_i. The sets satisfying this condition form the independent sets of a matroid, called a partition matroid. The sets C_i are called the categories or the blocks of the partition matroid. A basis of the partition matroid is a set whose intersection with every bloc ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Matroid
In combinatorics, a branch of mathematics, a matroid is a structure that abstracts and generalizes the notion of linear independence in vector spaces. There are many equivalent ways to define a matroid 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 sets, a finite matroid is equivalent to a geometric lattice. Matroid theory borrows extensively from the terminology of 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. Definition There are many equivalent ( cryptomorphic) ways to define a (finite) matroid.A standard source for basic definitions and results about matroids is Oxley (1992). An older standard source is Welsh (1976). See Brylawsk ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Direct Sum
The direct sum is an operation between structures in abstract algebra, a branch of mathematics. It is defined differently, but analogously, for different kinds of structures. To see how the direct sum is used in abstract algebra, consider a more elementary kind of structure, the abelian group. The direct sum of two abelian groups A and B is another abelian group A\oplus B consisting of the ordered pairs (a,b) where a \in A and b \in B. To add ordered pairs, we define the sum (a, b) + (c, d) to be (a + c, b + d); in other words addition is defined coordinate-wise. For example, the direct sum \Reals \oplus \Reals , where \Reals is real coordinate space, is the Cartesian plane, \R ^2 . A similar process can be used to form the direct sum of two vector spaces or two modules. We can also form direct sums with any finite number of summands, for example A \oplus B \oplus C, provided A, B, and C are the same kinds of algebraic structures (e.g., all abelian groups, or all vector spa ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


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 permutation of the elements is a symmetry. Definition The uniform matroid U^r_n is defined over a set of n elements. A subset of the elements is independent if and only if it contains at most r elements. A subset is a basis if it has exactly r elements, and it is a circuit if it has exactly r+1 elements. The rank of a subset S is \min(, S, ,r) and the rank of the matroid is r. A matroid of rank r is uniform if and only if all of its circuits have exactly r+1 elements. The matroid U^2_n is called the n-point line. Duality and minors The dual matroid of the uniform matroid U^r_n is another uniform matroid U^_n. A uniform matroid is self-dual if and only if r=n/2. Every minor of a uniform matroid is uniform. Restricting a uniform matroid U^r_n by one element (as long as r 0) prod ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Disjoint Sets
In mathematics, two sets are said to be disjoint sets if they have no element in common. Equivalently, two disjoint sets are sets whose intersection is the empty set.. For example, and are ''disjoint sets,'' while and are not disjoint. A collection of two or more sets is called disjoint if any two distinct sets of the collection are disjoint. Generalizations This definition of disjoint sets can be extended to a family of sets \left(A_i\right)_: the family is pairwise disjoint, or mutually disjoint if A_i \cap A_j = \varnothing whenever i \neq j. Alternatively, some authors use the term disjoint to refer to this notion as well. For families the notion of pairwise disjoint or mutually disjoint is sometimes defined in a subtly different manner, in that repeated identical members are allowed: the family is pairwise disjoint if A_i \cap A_j = \varnothing whenever A_i \neq A_j (every two ''distinct'' sets in the family are disjoint).. For example, the collection of sets is ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


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 size of an independent subset of ''S'', and the rank function of the matroid maps sets of elements to their ranks. The rank function is one of the fundamental concepts of matroid theory via which matroids may be axiomatized. Matroid rank functions form an important subclass of the submodular set functions. The rank functions of matroids defined from certain other types of mathematical object such as undirected graphs, matrices, and field extensions are important within the study of those objects. Examples In all examples, ''E'' is the base set of the matroid, and ''B'' is some subset of ''E''. * Let ''M'' be the free matroid, where the independent sets are all subsets of ''E''. Then the rank function of ''M'' is simply: ''r''(''B'') = , ''B'', . * Let ''M'' be a uniform matroid ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Transversal Matroid
In combinatorics, a branch of mathematics, a matroid is a structure that abstracts and generalizes the notion of linear independence in vector spaces. 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 sets, a finite matroid is equivalent to a geometric lattice. Matroid theory borrows extensively from the terminology of 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. Definition There are many equivalent (Cryptomorphism, cryptomorphic) ways to define a (finite) matroid.A standard source for basic definitions and results about matroids is Oxley (1992). An older standard source ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  




Dual Matroid
In matroid theory, the dual of a matroid M is another matroid M^\ast that has the same elements as M, and in which a set is independent if and only if M has a basis set disjoint from it... Matroid duals go back to the original paper by Hassler Whitney defining matroids.. Reprinted in , pp. 55–79. See in particular section 11, "Dual matroids", pp. 521–524. They generalize to matroids the notions of plane graph duality. Basic properties Duality is an involution: for all M, (M^\ast)^\ast=M. An alternative definition of the dual matroid is that its basis sets are the complements of the basis sets of M. The basis exchange axiom, used to define matroids from their bases, is self-complementary, so the dual of a matroid is necessarily a matroid. The flats of M are complementary to the cyclic sets (unions of circuits) of M^\ast, and vice versa. If r is the rank function of a matroid M on ground set E, then the rank function of the dual matroid is r^\ast(S)=r(E \setminus S)+, ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


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 to graph minors, and the restriction and contraction operations by which they are formed correspond to edge deletion and edge contraction operations in graphs. The theory of matroid minors leads to structural decompositions of matroids, and characterizations of matroid families by forbidden minors, analogous to the corresponding theory in graphs. Definitions If ''M'' is a matroid on the set ''E'' and ''S'' is a subset of ''E'', then the restriction of ''M'' to ''S'', written ''M'' , ''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''. If ''T'' is an independent ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Maximum Matching
Maximum cardinality matching is a fundamental problem in graph theory. We are given a graph , and the goal is to find a matching containing as many edges as possible; that is, a maximum cardinality subset of the edges such that each vertex is adjacent to at most one edge of the subset. As each edge will cover exactly two vertices, this problem is equivalent to the task of finding a matching that covers as many vertices as possible. An important special case of the maximum cardinality matching problem is when is a bipartite graph, whose vertices are partitioned between left vertices in and right vertices in , and edges in always connect a left vertex to a right vertex. In this case, the problem can be efficiently solved with simpler algorithms than in the general case. Algorithms for bipartite graphs Flow-based algorithm The simplest way to compute a maximum cardinality matching is to follow the Ford–Fulkerson algorithm. This algorithm solves the more general problem o ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Bipartite Graph
In the mathematical field of graph theory, a bipartite graph (or bigraph) is a graph whose vertices can be divided into two disjoint and independent sets U and V, that is every edge connects a vertex in U to one in V. Vertex sets U and V are usually called the ''parts'' of the graph. Equivalently, a bipartite graph is a graph that does not contain any odd-length cycles. The two sets U and V may be thought of as a coloring of the graph with two colors: if one colors all nodes in U blue, and all nodes in V red, each edge has endpoints of differing colors, as is required in the graph coloring problem.. In contrast, such a coloring is impossible in the case of a non-bipartite graph, such as a triangle: after one node is colored blue and another red, the third vertex of the triangle is connected to vertices of both colors, preventing it from being assigned either color. One often writes G=(U,V,E) to denote a bipartite graph whose partition has the parts U and V, with E denoting ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


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 weights, the weighted matroid intersection problem is to find a common independent set with the maximum possible weight. These problems generalize many problems in combinatorial optimization including finding maximum matchings and maximum weight matchings in bipartite graphs and finding arborescences in directed graphs. The matroid intersection theorem, due to Jack Edmonds,. Reprinted in M. Jünger et al. (Eds.): Combinatorial Optimization (Edmonds Festschrift), LNCS 2570, pp. 1126, Springer-Verlag, 2003. says that there is always a simple upper bound certificate, consisting of a partitioning of the ground set amongst the two matroids, whose value (sum of respective ranks) equals the size of a maximum common independent set. Based on this theorem, the matroid intersection problem fo ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Clique Complex
Clique complexes, independence complexes, flag complexes, Whitney complexes and conformal hypergraphs are closely related mathematical objects in graph theory and geometric topology that each describe the cliques (complete subgraphs) of an undirected graph. Clique complex The clique complex of an undirected graph is an abstract simplicial complex (that is, a family of finite sets closed under the operation of taking subsets), formed by the sets of vertices in the cliques of . Any subset of a clique is itself a clique, so this family of sets meets the requirement of an abstract simplicial complex that every subset of a set in the family should also be in the family. The clique complex can also be viewed as a topological space in which each clique of vertices is represented by a simplex of dimension . The 1-skeleton of (also known as the ''underlying graph'' of the complex) is an undirected graph with a vertex for every 1-element set in the family and an edge for every 2 ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]