Greedy algorithm and symmetric matroids
Mathematical Programming: Series A and B
Discrete Mathematics
Journal of Combinatorial Theory Series B
Journal of Algebraic Combinatorics: An International Journal
Multimatroids I. Coverings by Independent Sets
SIAM Journal on Discrete Mathematics
Hi-index | 0.05 |
We give an independent set axiomatization of symplectic matroids, a large and important class of Coxeter matroids. As an application, we construct a new class of examples of symplectic matroids from graphs. As another application, we prove that symplectic matroids satisfy a certain "basis exchange property," and we conjecture that this basis exchange property in fact characterizes symplectic matroids.