On powers of the cover ideals of graphs
Commutative Algebra
2023-03-09 v4 Combinatorics
Abstract
For a simple graph , assume that is the vertex cover ideal of and is the -th symbolic power of . We prove that for all and for all odd cycle . For a simplicial complex , we show that is vertex decomposable if is weakly polymatroidal. Let be a fully clique-whiskering graph, we prove that is weakly polymatroidal for all .
Keywords
Cite
@article{arxiv.2211.15796,
title = {On powers of the cover ideals of graphs},
author = {Dancheng Lu and Zexin Wang},
journal= {arXiv preprint arXiv:2211.15796},
year = {2023}
}
Comments
Comments are welcome, to appear in Osaka journal of mathematics