Add to ORKGMatorids provide useful abstraction in combinatorics and have a number of applications in many areas. Gammoids, which is one of many classes of matroids, and they can be represented by directed graphs, which make them easy to visualize. Due to matroids being discovered quite a long time ago, there are a number of great papers and books to do research on. From results made by Albrecht Immanuel and others, it is made clear that by transforming a gammoid into its standard representation, the cyclic flats can be found via its dual representation. Based on his results, it is possible to find the cyclic flats of any gammoid by finding the dual
The first non-trivial case of Hadwiger's conjecture for oriented matroids reads as follows. If $\mat...
AbstractConsider the moment curve in the real euclidean space Rddefined parametrically by the map γ:...
There is a renewed interest in matroid perspectives, either for their relevance in other fields of c...
Matorids provide useful abstraction in combinatorics and have a number of applications in many areas...
Matroids have a wide variety of distinct, cryptomorphic axiom systems that are capable of defining t...
Let T(M; x,y) = ∑ij Tij xiyjdenote the Tutte polynomial of the matroid M. If Tij is a corner of T (M...
AbstractThe two main results of this paper identify the “strict gammoids” of Mason [7] with duals of...
A at of a matroid is cyclic if it is a union of circuits. The cyclic ats of a matroid form a lattice...
We give an alternative method for counting the number of graph compositions of any graph G. In parti...
Las Vergnas [6] and Nguyen [7] independently described the free erection of a matroid M and gave an ...
Las Vergnas [6] and Nguyen [7] independently described the free erection of a matroid M and gave an ...
A gaussoid is a combinatorial structure that encodes independence in probability and statistics, jus...
AbstractA matroid may be characterized by the collection of its bases or by the collection of its ci...
Matroids (also called combinatorial geometries) present a strong combinatorial generalization of gra...
Bergman complexes are polyhedral complexes associated to matroids. Faces of these complexes are cert...
The first non-trivial case of Hadwiger's conjecture for oriented matroids reads as follows. If $\mat...
AbstractConsider the moment curve in the real euclidean space Rddefined parametrically by the map γ:...
There is a renewed interest in matroid perspectives, either for their relevance in other fields of c...
Matorids provide useful abstraction in combinatorics and have a number of applications in many areas...
Matroids have a wide variety of distinct, cryptomorphic axiom systems that are capable of defining t...
Let T(M; x,y) = ∑ij Tij xiyjdenote the Tutte polynomial of the matroid M. If Tij is a corner of T (M...
AbstractThe two main results of this paper identify the “strict gammoids” of Mason [7] with duals of...
A at of a matroid is cyclic if it is a union of circuits. The cyclic ats of a matroid form a lattice...
We give an alternative method for counting the number of graph compositions of any graph G. In parti...
Las Vergnas [6] and Nguyen [7] independently described the free erection of a matroid M and gave an ...
Las Vergnas [6] and Nguyen [7] independently described the free erection of a matroid M and gave an ...
A gaussoid is a combinatorial structure that encodes independence in probability and statistics, jus...
AbstractA matroid may be characterized by the collection of its bases or by the collection of its ci...
Matroids (also called combinatorial geometries) present a strong combinatorial generalization of gra...
Bergman complexes are polyhedral complexes associated to matroids. Faces of these complexes are cert...
The first non-trivial case of Hadwiger's conjecture for oriented matroids reads as follows. If $\mat...
AbstractConsider the moment curve in the real euclidean space Rddefined parametrically by the map γ:...
There is a renewed interest in matroid perspectives, either for their relevance in other fields of c...