加载中…
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 .

生成讲解博客的中文版本

生成AI智能校验的中文版本