Replication in critical graphs and the persistence of monomial ideals

From MaRDI portal
Publication:2434895

DOI10.1016/J.JCTA.2013.12.005zbMATH Open1281.05062arXiv1301.6983OpenAlexW2082482347MaRDI QIDQ2434895FDOQ2434895


Authors: Tomáš Kaiser, Matěj Stehlík, Riste Škrekovski Edit this on Wikidata


Publication date: 31 January 2014

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Abstract: Motivated by questions about square-free monomial ideals in polynomial rings, in 2010 Francisco et al. conjectured that for every positive integer k and every k-critical (i.e., critically k-chromatic) graph, there is a set of vertices whose replication produces a (k+1)-critical graph. (The replication of a set W of vertices of a graph is the operation that adds a copy of each vertex w in W, one at a time, and connects it to w and all its neighbours.) We disprove the conjecture by providing an infinite family of counterexamples. Furthermore, the smallest member of the family answers a question of Herzog and Hibi concerning the depth functions of square-free monomial ideals in polynomial rings, and a related question on the persistence property of such ideals.


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




Recommendations




Cites Work


Cited In (26)

Uses Software





This page was built for publication: Replication in critical graphs and the persistence of monomial ideals

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