相关论文: Sequentially Cohen-Macaulay Edge Ideals

Let $G$ be a permutation graph. We show that $G$ is Cohen-Macaulay if and only if $G$ is unmixed and vertex decomposable. When this is the case, we obtain a combinatorial description for the $a$-invariant of $G$. Moreover, we characterize…

In this paper, we study the notion of chordality and cycles in hypergraphs from a commutative algebraic point of view. The corresponding concept of chordality in commutative algebra is having a linear resolution. However, there is no…

Given a simplicial complex we associate to it a squarefree monomial ideal which we call the face ideal of the simplicial complex, and show that it has linear quotients. It turns out that its Alexander dual is a whisker complex. We apply…

In a recent paper, Duval, Goeckner, Klivans and Martin disproved the longstanding conjecture by Stanley, that every Cohen-Macaulay simplicial complex is partitionable. We construct counterexamples to this conjecture that are even…

Let $I=I(D)$ be the edge ideal of a weighted oriented graph $D$, let $G$ be the underlying graph of $D$, and let $I^{(n)}$ be the $n$-th symbolic power of $I$ defined using the minimal primes of $I$. We prove that $I^2=I^{(2)}$ if and only…

We prove several results about chordal graphs and weighted chordal graphs by focusing on exposed edges. These are edges that are properly contained in a single maximal complete subgraph. This leads to a characterization of chordal graphs…

We first construct the total simplicial complex (TSC) of a finite simple graph $G$ in order to generalize the total graph $T(G)$. We show that $\Delta_T(G)$ is not Cohen-Macaulay (CM) in general. For a connected graph $G$, we prove that the…

Let $G$ be an $n$-vertex connected graph. A cyclic base ordering of $G$ is a cyclic ordering of all edges such that every cyclically consecutive $n-1$ edges induce a spanning tree of $G$. In this project, we study cyclic base ordering of…

For a finite simple graph $G$ and an integer $r \ge 1$, the $r$-connected ideal $I_r(G)$ is the squarefree monomial ideal generated by the vertex sets of connected induced subgraphs of size $r+1$, extending the classical edge ideal. We…

In this paper, we characterize the set of spanning trees of $\mathcal{G}_{n,r}^1$ (a simple connected graph consisting of $n$ edges, containing exactly one $1$-edge-connected chain of $r$ cycles $\mathbb{C}_r^1$ and…

Let $G=(V,E)$ be a finite, simple graph. We consider for each oriented graph $G_{\cal O}$ associated to an orientation ${\cal O}$ of the edges of $G$, the toric ideal $P_{G_{\cal O}}$. In this paper we study those graphs with the property…

Using the concept of $d$-collapsibility from combinatorial topology, we define chordal simplicial complexes and show that their Stanley-Reisner ideals are componentwise linear. Our construction is inspired by and an extension of "chordal…

An ideal $I$ of a commutative ring $R$ is said to be of linear type when its Rees algebra and symmetric algebra exhibit isomorphism. In this paper, we investigate the conjecture put forth by Jayanthan, Kumar, and Sarkar (2021) that if $G$…

We prove two recent conjectures on some upper bounds for the Castelnuovo-Mumford regularity of the binomial edge ideals of some different classes of graphs. We prove the conjecture of Matsuda and Murai for graphs which has a cut edge or a…

A simple graph G is k-ordered (respectively, k-ordered hamiltonian) if, for any sequence of k distinct vertices v_1, ..., v_k of G, there exists a cycle (respectively, a hamiltonian cycle) in G containing these k vertices in the specified…

A graph $G$ is well-covered if it has no isolated vertices and all the maximal independent sets have the same cardinality. If furthermore two times this cardinality is equal to $|V(G)|$, the graph $G$ is called very well-covered. The class…

For a simplicial complex $\Delta$, the affect of the expansion functor on combinatorial properties of $\Delta$ and algebraic properties of its Stanley-Reisner ring has been studied in some previous papers. In this paper, we consider the…

All Cohen--Macaulay polymatroidal ideals are classified. The Cohen--Macaulay polymatroidal ideals are precisely the principal ideals, the Veronese ideals, and the squarefree Veronese ideals.

A labeling of the vertices of a graph by elements of any abelian group $A$ induces a labeling of the edges by summing the labels of their endpoints. Hovey defined the graph $G$ to be $A$-cordial if it has such a labeling where the vertex…

We first characterise graphs with binomial edge ideals of K\"onig type as those for which the path covering number is equal to a minor variant of the scattering number. These are well-studied graph-theoretic invariants, allowing us to apply…