A conjecture on critical graphs and connections to the persistence of associated primes

Details A conjecture on critical graphs and connections to the persistence of associated primes A conjecture on critical graphs and connections to the persistence of associated primes

2009-11-10

arxiv.org/abs/0911.1978v2

Mathematics

Commutative Algebra

11 pages; Minor changes throughout the paper; to appear in Discrete Math.

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A conjecture on critical graphs and connections to the persistence of associated primes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A conjecture on critical graphs and connections to the persistence of associated primes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A conjecture on critical graphs and connections to the persistence of associated primes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-51919