Homological invariants of Cameron–Walker Graphs
@article{Hibi2020HomologicalIO, title={Homological invariants of Cameron–Walker Graphs}, author={Takayuki Hibi and Hiroju Kanno and Kyouko Kimura and Kazunori Matsuda and Adam Van Tuyl}, journal={arXiv: Commutative Algebra}, year={2020} }
Let $G$ be a finite simple connected graph on $[n]$ and $R = K[x_1, \ldots, x_n]$ the polynomial ring in $n$ variables over a field $K$. The edge ideal of $G$ is the ideal $I(G)$ of $R$ which is generated by those monomials $x_ix_j$ for which $\{i, j\}$ is an edge of $G$. In the present paper, the possible tuples $(n, {\rm depth} (R/I(G)), {\rm reg} (R/I(G)), \dim R/I(G), {\rm deg} \ h(R/I(G)))$, where ${\rm deg} \ h(R/I(G))$ is the degree of the $h$-polynomial of $R/I(G)$, arising from Cameron…
7 Citations
Behaviors of pairs of dimensions and depths of edge ideals
- Mathematics
- 2023
. Edge ideals of finite simple graphs G on n vertices are the ideals I ( G ) of the polynomial ring S in n variables generated by the quadratic monomials associated with the edges of G . In this…
On some algebraic invariants and Cohen-Macaulay graphs
- Mathematics
- 2022
. We study the algebraic invariants namely depth, Stanley depth, regularity and pro- jective dimension of the residue class rings of the edge ideals associated with the corona product of various…
The regularity and h-polynomial of Cameron-Walker graphs
- MathematicsEnumerative Combinatorics and Applications
- 2022
Fix an integer $n \geq 1$, and consider the set of all connected finite simple graphs on $n$ vertices. For each $G$ in this set, let $I(G)$ denote the edge ideal of $G$ in the polynomial ring $R =…
Matchings and squarefree powers of edge ideals
- MathematicsJ. Comb. Theory, Ser. A
- 2022
Squarefree powers of edge ideals are intimately related to matchings of the underlying graph. In this paper we give bounds for the regularity of squarefree powers of edge ideals, and we consider the…
On the three graph invariants related to matching of finite simple graphs
- Mathematics
- 2021
ABSTRACT. Let G be a finite simple graph on the vertex set V (G) and let ind-match(G), min-match(G) and match(G) denote the induced matching number, the minimum matching number and the matching…
The size of Betti tables of edge ideals arising from bipartite graphs
- Mathematics
- 2021
. Let pd( I ( G )) and reg( I ( G )) respectively denote the projective dimension and the regularity of the edge ideal I ( G ) of a graph G . For any positive integer n , we determine all pairs (pd(…
Inequalities of invariants on Stanley–Reisner rings of Cohen–Macaulay simplicial complexes
- MathematicsJournal of Pure and Applied Algebra
- 2021
References
SHOWING 1-10 OF 17 REFERENCES
The regularity and h-polynomial of Cameron-Walker graphs
- MathematicsEnumerative Combinatorics and Applications
- 2022
Fix an integer $n \geq 1$, and consider the set of all connected finite simple graphs on $n$ vertices. For each $G$ in this set, let $I(G)$ denote the edge ideal of $G$ in the polynomial ring $R =…
Certain algebraic invariants of edge ideals of join of graphs
- Mathematics
- 2019
Let $G$ be a simple graph and $I(G)$ be its edge ideal. In this article, we study the Castelnuovo-Mumford regularity of symbolic powers of edge ideals of join of graphs. As a consequence, we prove…
Improved bounds for the regularity of edge ideals of graphs
- Mathematics
- 2018
Let G be a graph with n vertices, let $$S={\mathbb {K}}[x_1,\dots ,x_n]$$S=K[x1,⋯,xn] be the polynomial ring in n variables over a field $${\mathbb {K}}$$K and let I(G) denote the edge ideal of G.…
Arithmetic of Blowup Algebras
- Mathematics
- 1994
1. Krull dimension 2. Syzygetic sequences 3. Approximation complexes 4. Linkage and Koszul homology 5. Arithmetic of Rees algebras 6. Factoriality 7. Ideal transforms 8. The equations of Rees…
Regularity and h-Polynomials of Edge Ideals
- MathematicsElectron. J. Comb.
- 2019
If $G$ is a graph on $n$ vertices, it is shown that ${\rm reg}\left(R/I(G)\right) + \deg h_{R/ I(G)}(t) \leqslant n$.
Regularity, matchings and Cameron–Walker graphs
- MathematicsCollectanea Mathematica
- 2019
Let G be a simple graph and let $$\beta (G)$$ β ( G ) be the matching number of G . It is well-known that $${{\,\mathrm{reg}\,}}I(G) \leqslant \beta (G)+1$$ reg I ( G ) ⩽ β ( G ) + 1 . In this paper…
The graphs with maximum induced matching and maximum matching the same size
- MathematicsDiscret. Math.
- 2005
Some algebraic invariants of edge ideal of circulant graphs
- Mathematics
- 2017
Let $G$ be the circulant graph $C_n(S)$ with $S\subseteq\{ 1,\ldots,\left \lfloor\frac{n}{2}\right \rfloor\}$ and let $I(G)$ be its edge ideal in the ring $K[x_0,\ldots,x_{n-1}]$. Under the…