On the rank functions of $\mathcal{H}$-matroids
Keywords:
Matroid, H-Matroid, Simplicial complex, Rank functionAbstract
The notion of $\mathcal{H}$-matroids was introduced by U. Faigle and S. Fujishige in 2009 as a general model for matroids and the greedy algorithm. They gave a characterization of $\mathcal{H}$-matroids by the greedy algorithm. In this note, we give a characterization of some $\mathcal{H}$-matroids by rank functions.
Downloads
References
U. Faigle and S. Fujishige, A general model for matroids and the greedy algorithm, Math. Program. Ser. A 119(2) (2009) 353-369.
S. Fujishige, Submodular Functions and Optimization, Annals of Discrete Mathematics 58, Elsevier, Amsterdam (2005).
S. Fujishige, G. A. Koshevoy, and Y. Sano, Matroids on convex geometries (cg-matroids), Discrete Math. 307(15) (2007) 1936-1950.
B. Korte, L. Lovász, and R. Schrader, Greedoids, Algorithms and Combinatorics 4, Springer-Verlag, Berlin (1991).
J. Oxley, Matroid Theory, Oxford Graduate Texts in Mathematics 3, Oxford University Press, Oxford (1992).
Y. Sano, Rank functions of strict cg-matroids, Discrete Math. 308(20) (2008) 4734-4744.
Y. Sano, Matroids on convex geometries: Subclasses, operations, and optimization, Publ. Res. Inst. Math. Sci. 47(3) (2011) 671-703.
A. Schrijver, Combinatorial Optimization: Polyhedra and Efficiency, Algorithms and Combinatorics 24, Springer-Verlag, Berlin (2003).
D. J. A. Welsh, Matroid Theory, L.M.S. Monographs 8, Academic Press, London (1976).
H. Whitney, On the abstract properties of linear dependence, Amer. J. Math. 57(3) (1935) 509-533.
