English
Related papers

Related papers: Squarefree monomial ideals that fail the persisten…

200 papers

The depth of squarefree powers of a squarefree monomial ideal is introduced. Let $I$ be a squarefree monomial ideal of the polynomial ring $S=K[x_1,\ldots,x_n]$. The $k$-th squarefree power $I^{[k]}$ of $I$ is the ideal of $S$ generated by…

Commutative Algebra · Mathematics 2022-09-19 Nursel Erey , Jürgen Herzog , Takayuki Hibi , Sara Saeedi Madani

Let G be a plane graph of girth at least five. We show that if there exists a 3-coloring phi of a cycle C of G that does not extend to a 3-coloring of G, then G has a subgraph H on O(|C|) vertices that also has no 3-coloring extending phi.…

Combinatorics · Mathematics 2017-07-07 Zdenek Dvorak , Daniel Kral , Robin Thomas

Let $S=K[x_1,\ldots,x_n]$ be the polynomial ring in $n$ variables over a field $K$ and $I\subset S$ a squarefree monomial ideal. In the present paper we are interested in the monomials $u \in S$ belonging to the socle $\Soc(S/I^{k})$ of…

Commutative Algebra · Mathematics 2013-08-27 Jürgen Herzog , Takayuki Hibi

Let $I$ be a monomial ideal in a polynomial ring. In this paper, we study the asymptotic behavior of the set of associated radical ideals of the (symbolic) powers of $I$. We show that both $\asr(I^s)$ and $\asr(I^{(s)})$ need not stabilize…

Commutative Algebra · Mathematics 2024-12-20 Nguyen Thu Hang , Truong Thi Hien

Let $\mathbb{K}$ be a field and $S=\mathbb{K}[x_1,\dots,x_n]$ be the polynomial ring in $n$ variables over $\mathbb{K}$. Assume that $G$ is a graph with edge ideal $I(G)$. We prove that the modules $S/\overline{I(G)^k}$ and…

Commutative Algebra · Mathematics 2018-08-13 S. A. Seyed Fakhari

We prove that the depth functions of cover ideals of balanced hyper- gragh have the non-increasing property. Furthermore, we also give a bound for the index of depth stability of these ideals.

Commutative Algebra · Mathematics 2017-11-28 Nguyen Thu Hang

The following relaxation of proper coloring the square of a graph was recently introduced: for a positive integer $h$, the proper $h$-conflict-free chromatic number of a graph $G$, denoted $\chi_{pcf}^h(G)$, is the minimum $k$ such that $G$…

Combinatorics · Mathematics 2024-04-18 Eun-Kyung Cho , Ilkyoo Choi , Hyemin Kwon , Boram Park

If $J\subset I$ are two monomials ideals, we give a practical upper bound for the Stanley depth of $J/I$, which we call it the \emph{quasi-depth} of $J/I$. Also, we compute the quasi-depth of several classes of square free monomial ideals.…

Commutative Algebra · Mathematics 2017-11-06 Mircea Cimpoeas

Let $G$ be a finite simple graph, and let $I(G)$ denote its edge ideal. In this paper, we investigate the asymptotic behavior of the syzygies of powers of edge ideals through the lens of homological shift ideals $\text{HS}_i(I(G)^k)$. We…

Commutative Algebra · Mathematics 2025-04-18 Antonino Ficarra , Ayesha Asloob Qureshi

Let $\mathbb{K}$ be a field and $S=\mathbb{K}[x_1,\dots,x_n]$ be the polynomial ring in $n$ variables over the field $\mathbb{K}$. Suppose that $\mathcal{C}$ is a chordal clutter with $n$ vertices and assume that the minimum edge…

Commutative Algebra · Mathematics 2014-09-19 S. A. Seyed Fakhari

We study the licci property for several classes of squarefree monomial ideals arising from graphs and related combinatorial structures. We characterize licci bi-Cohen-Macaulay squarefree monomial ideals, complementary edge ideals, $t$-path…

Commutative Algebra · Mathematics 2026-03-17 Om Prakash Bhardwaj , Trung Chau , Omkar Javadekar

Many conjectures and open problems in graph theory can either be reduced to cubic graphs or are directly stated for cubic graphs. Furthermore, it is known that for a lot of problems, a counterexample must be a snark, i.e. a bridgeless cubic…

Combinatorics · Mathematics 2023-09-27 Edita Máčajová , Giuseppe Mazzuoccolo , Vahan Mkrtchyan , Jean Paul Zerafa

We systematically determine circular chromatic index of small graphs and multigraphs with maximum degree $4$, $5$, $6$ (and also their number for a given small order). We construct several infinite families of such graphs with circular…

Combinatorics · Mathematics 2026-03-11 Ján Mazák , Filip Zrubák

In this paper we introduce a family of monomial ideals with the persistence property. Given positive integers $n$ and $t$, we consider the monomial ideal $I=Ind_t(P_n)$ generated by all monomials $\textbf{x} ^F$, where $F$ is an independent…

Commutative Algebra · Mathematics 2018-05-01 Somayeh Moradi , Masoomeh Rahimbeigi , Fahimeh Khosh-Ahang , Ali Soleyman Jahan

We first consider the class K of graphs on a zero-dimensional metrizable compact space with continuous chromatic number at least three. We provide a concrete basis of size continuum for K made up of countable graphs, comparing them with the…

Dynamical Systems · Mathematics 2023-07-04 Dominique Lecomte

In this paper, we first give some sufficient criteria for normality of monomial ideals. As applications, we show that closed neighborhood ideals of complete bipartite graphs are normal, and hence satisfy the (strong) persistence property.…

Commutative Algebra · Mathematics 2023-08-15 Mehrdad Nasernejad , Somayeh Bandari , Leslie G. Roberts

There is a class of graphs with well-covered dimension equal to the simplicial clique number that contains all chordal graphs and infinitely many other graphs. These graphs generalize a result by Brown and Nowakowski on the well-covered…

Combinatorics · Mathematics 2014-11-25 Gabriella Clemente

We introduce the notion of sortability and $t$-sortability for a simplicial complex and study the graphs for which their independence complexes are either sortable or $t$-sortable. We show that the proper interval graphs are precisely the…

Commutative Algebra · Mathematics 2019-08-21 Jürgen Herzog , Fahimeh Khosh-Ahang , Somayeh Moradi , Masoomeh Rahimbeigi

The aim of this paper is to study the Stanley depth of symbolic powers of a squarefree monomial ideal. We prove that for every squarefree monomial ideal $I$ and every pair of integers $k, s\geq 1$, the inequalities ${\rm sdepth}…

Commutative Algebra · Mathematics 2013-06-04 S. A. Seyed Fakhari

We construct dense, triangle-free, chromatic-critical graphs of chromatic number $k$ for all $k\geq 4$. For $k\geq 6$ our constructions have $> (\frac{1}{4} -\varepsilon)n^2$ edges, which is asymptotically best possible by Tur\'an's…

Combinatorics · Mathematics 2014-01-29 Wesley Pegden