arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0911.1978math.ACmath.CO

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

Christopher A. Francisco, Huy Tai Ha, Adam Van Tuyl

英文摘要:

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 χ_f(G), the fractional chromatic number of the graph G, satisfies χ(G) -1 < χ_f(G) <= χ(G). We give an algebraic proof of this result.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑