On powers of the cover ideals of graphs

Abstract

For a simple graph G, assume that J(G) is the vertex cover ideal of G and J(G)(s) is the s-th symbolic power of J(G). We prove that (J(C)(s))=(J(C)s) for all s≥ 1 and for all odd cycle C. For a simplicial complex , we show that is vertex decomposable if I is weakly polymatroidal. Let W=Gπ be a fully clique-whiskering graph, we prove that J(W)s is weakly polymatroidal for all s≥ 1.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…