English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

There is a natural one-to-one correspondence between squarefree monomialideals and finite simple hypergraphs via the cover ideal construction. Let H bea finite simple hypergraph, and let J = J(H) be its cover ideal in a polynomialring R. We give an explicit description of all associated primes of R/J^s, forany power J^s of J, in terms of the coloring properties of hypergraphs arisingfrom H. We also give an algebraic method for determining the chromatic numberof H, proving that it is equivalent to a monomial ideal membership probleminvolving powers of J. Our work yields two new purely algebraiccharacterizations of perfect graphs, independent of the Strong Perfect GraphTheorem; the first characterization is in terms of the sets Ass(R/J^s), whilethe second characterization is in terms of the saturated chain condition forassociated primes.

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