Depth of Binomial Edge Ideals in terms of Diameter and Vertex Connectivity

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Jayanthan, A. V., Sarkar, Rajib
Format: Preprint
Published: 2021
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866909153183662080
author Jayanthan, A. V.
Sarkar, Rajib
author_facet Jayanthan, A. V.
Sarkar, Rajib
contents Let $G$ be a simple connected non-complete graph and $J_G$ be its binomial edge ideal in a polynomial ring $S$. Using certain invariants associated to graphs, say $U(G)$, Banerjee and Núñez-Betancourt gave an upper bound for the depth of $S/J_G$, and Rouzbahani Malayeri, Saeedi Madani and Kiani obtained a lower bound, say $L(G)$. Hibi and Saeedi Madani gave a structural classification of graphs satisfying $L(G)=U(G)$. In this article, we give structural classification of graphs satisfying $L(G)+1=U(G)$. We also compute the depth of $S/J_G$ for all such graphs $G$.
format Preprint
id arxiv_https___arxiv_org_abs_2112_04835
institution arXiv
publishDate 2021
record_format arxiv
spellingShingle Depth of Binomial Edge Ideals in terms of Diameter and Vertex Connectivity
Jayanthan, A. V.
Sarkar, Rajib
Commutative Algebra
Combinatorics
13D02, 13C13, 05E40
Let $G$ be a simple connected non-complete graph and $J_G$ be its binomial edge ideal in a polynomial ring $S$. Using certain invariants associated to graphs, say $U(G)$, Banerjee and Núñez-Betancourt gave an upper bound for the depth of $S/J_G$, and Rouzbahani Malayeri, Saeedi Madani and Kiani obtained a lower bound, say $L(G)$. Hibi and Saeedi Madani gave a structural classification of graphs satisfying $L(G)=U(G)$. In this article, we give structural classification of graphs satisfying $L(G)+1=U(G)$. We also compute the depth of $S/J_G$ for all such graphs $G$.
title Depth of Binomial Edge Ideals in terms of Diameter and Vertex Connectivity
topic Commutative Algebra
Combinatorics
13D02, 13C13, 05E40
url https://arxiv.org/abs/2112.04835