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 -path ideals of a complete multipartite graph.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.