Colorings of hypergraphs, perfect graphs, and associated primes of powers of monomial ideals

From MaRDI portal
Publication:716459

DOI10.1016/J.JALGEBRA.2010.10.025zbMATH Open1227.13016arXiv0908.1505OpenAlexW2962719007MaRDI QIDQ716459FDOQ716459


Authors: Christopher A. Francisco, Adam Van Tuyl, Huy Tài Hà Edit this on Wikidata


Publication date: 22 September 2011

Published in: Journal of Algebra (Search for Journal in Brave)

Abstract: There is a natural one-to-one correspondence between squarefree monomial ideals and finite simple hypergraphs via the cover ideal construction. Let H be a finite simple hypergraph, and let J = J(H) be its cover ideal in a polynomial ring R. We give an explicit description of all associated primes of R/J^s, for any power J^s of J, in terms of the coloring properties of hypergraphs arising from H. We also give an algebraic method for determining the chromatic number of H, proving that it is equivalent to a monomial ideal membership problem involving powers of J. Our work yields two new purely algebraic characterizations of perfect graphs, independent of the Strong Perfect Graph Theorem; the first characterization is in terms of the sets Ass(R/J^s), while the second characterization is in terms of the saturated chain condition for associated primes.


Full work available at URL: https://arxiv.org/abs/0908.1505




Recommendations




Cites Work


Cited In (48)

Uses Software





This page was built for publication: Colorings of hypergraphs, perfect graphs, and associated primes of powers of monomial ideals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q716459)