AbstractMatroids are combinatorial abstractions of the linear hull operator; antimatroids, which are in a sense dual to them, are combinatorial abstractions of the convex hull operator. We prove that every antimatroid can be represented as a homomorphic image of a poset. We also prove a Ramsey-type result for antimatroids
For any given finite group G, we construct a convex polytope and an antimatroid whose automorphism g...
AbstractThe polymatroid matching problem, also known as the matchoid problem or the matroid parity p...
This dissertation explores questions about posets and polytopes through the lenses of positroids and...
AbstractMatroids are combinatorial abstractions of the linear hull operator; antimatroids, which are...
AbstractAntimatroids are combinatorial structures abstracting some properties of convexity, and in a...
Similarities and differences between matroids (abstract dependence systems) and antimatroids (abstra...
AbstractThis paper discusses polymatroid greedoids, a superclass of them, called local poset greedoi...
SIGLEBibliothek Weltwirtschaft Kiel C132,202 / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Tech...
AbstractIn this paper we suggest a generalization of the well known concept of matroid. This include...
AbstractAn antimatroid is a family of sets such that it contains an empty set, and it is accessible ...
This thesis is a compendium of three studies on which matroids and convex geometry play a central ro...
AbstractWe consider matroidal structures on convex geometries, which we call cg-matroids. The concep...
We show three main results concerning Hamiltonicity of graphs derived from antimatroids. These resul...
The notion of “antimatroid with repetition ” was conceived by Bjorner, Lovasz and Shor in 1991 as an...
AbstractAntimatroids generalize the notion of convexity in much the same way as matroids generalize ...
For any given finite group G, we construct a convex polytope and an antimatroid whose automorphism g...
AbstractThe polymatroid matching problem, also known as the matchoid problem or the matroid parity p...
This dissertation explores questions about posets and polytopes through the lenses of positroids and...
AbstractMatroids are combinatorial abstractions of the linear hull operator; antimatroids, which are...
AbstractAntimatroids are combinatorial structures abstracting some properties of convexity, and in a...
Similarities and differences between matroids (abstract dependence systems) and antimatroids (abstra...
AbstractThis paper discusses polymatroid greedoids, a superclass of them, called local poset greedoi...
SIGLEBibliothek Weltwirtschaft Kiel C132,202 / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Tech...
AbstractIn this paper we suggest a generalization of the well known concept of matroid. This include...
AbstractAn antimatroid is a family of sets such that it contains an empty set, and it is accessible ...
This thesis is a compendium of three studies on which matroids and convex geometry play a central ro...
AbstractWe consider matroidal structures on convex geometries, which we call cg-matroids. The concep...
We show three main results concerning Hamiltonicity of graphs derived from antimatroids. These resul...
The notion of “antimatroid with repetition ” was conceived by Bjorner, Lovasz and Shor in 1991 as an...
AbstractAntimatroids generalize the notion of convexity in much the same way as matroids generalize ...
For any given finite group G, we construct a convex polytope and an antimatroid whose automorphism g...
AbstractThe polymatroid matching problem, also known as the matchoid problem or the matroid parity p...
This dissertation explores questions about posets and polytopes through the lenses of positroids and...
DOI
Add to ORKG