On the matroidal path ideals

Abstract

We prove that the set of all paths of a fixed length in a complete multipartite graph is the bases of a matroid. Moreover, we discuss the Cohen-Macaulayness and depth of powers of $t$-path ideals of a complete multipartite graph.

This paper has been published in Journal of Algebra and Its Applications

References in corpus (1)

• Discrete Polymatroids