A conjecture on critical graphs and connections to the persistence of associated primes
From MaRDI portal
(Redirected from Publication:982625)
Abstract: We introduce a conjecture about constructing critically (s+1)-chromatic graphs from critically s-chromatic graphs. We then show how this conjecture implies that any unmixed height two square-free monomial ideal I, i.e., the cover ideal of a finite simple graph, has the persistence property, that is, Ass(R/I^s) subseteq Ass(R/I^{s+1}) for all s >= 1. To support our conjecture, we prove that the statement is true if we also assume that chi_f(G), the fractional chromatic number of the graph G, satisfies chi(G) -1 < chi_f(G) <= chi(G). We give an algebraic proof of this result.
Recommendations
- Squarefree monomial ideals that fail the persistence property and non-increasing depth
- Replication in critical graphs and the persistence of monomial ideals
- Associated primes of powers of cover ideals under graph operations
- Colorings of hypergraphs, perfect graphs, and associated primes of powers of monomial ideals
- Generalized cover ideals and the persistence property
Cites work
- Associated primes of monomial ideals and odd holes in graphs
- Asymptotic Stability of Ass(M/I n M)
- Chromatic polynomials and order ideals of monomials
- Colorings of hypergraphs, perfect graphs, and associated primes of powers of monomial ideals
- Combinatorial secant varieties
- scientific article; zbMATH DE number 1131873 (Why is no real title available?)
- scientific article; zbMATH DE number 1515218 (Why is no real title available?)
- scientific article; zbMATH DE number 1565322 (Why is no real title available?)
- Planar graphs as minimal resolutions of trivariate monomial ideals
- Recognizing graph theoretic properties with polynomial ideals
- Sur le coloriage des graphs
- The coloring ideal and coloring complex of a graph
- The depth of powers of an ideal
Cited in
(18)- Associated primes of powers of edge ideals
- Normality criteria for monomial ideals
- Primality of weakly connected collections of cells and weakly closed path polyominoes
- Powers of sums and their associated primes
- Irreducible decomposition of powers of edge ideals
- Monomial ideals whose depth function has any given number of strict local maxima
- Squarefree monomial ideals that fail the persistence property and non-increasing depth
- Replication in critical graphs and the persistence of monomial ideals
- Generalized cover ideals and the persistence property
- Squarefree monomial ideals with constant depth function
- On the associated primes and the depth of the second power of squarefree monomial ideals
- Persistence and stability properties of powers of ideals
- A family of monomial ideals with the persistence property
- Strong persistence and associated primes of powers of monomial ideals
- The depth function of vertex cover ideals of weighted unimodular hypergraphs
- Colorings of hypergraphs, perfect graphs, and associated primes of powers of monomial ideals
- On the set of associated radicals of powers of monomial ideals
- Combinatorial characterizations of the saturation and the associated primes of the fourth power of edge ideals
This page was built for publication: A conjecture on critical graphs and connections to the persistence of associated primes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q982625)
