Related papers: Jump Sequences of Edge Ideals

In this paper, we refer to a asymptotic degree sequence as $\mathscr{D}=(d_1,d_2,\dots,d_n)$. The examination of topological indices on trees gives us a general overview through bounds to find the maximum and minimum bounds which reflect…

Let $G$ be an undirected graph. An edge of $G$ dominates itself and all edges adjacent to it. A subset $E'$ of edges of $G$ is an edge dominating set of $G$, if every edge of the graph is dominated by some edge of $E'$. We say that $E'$ is…

A \emph{resolving set} $R$ in a graph $G$ is a set of vertices such that every vertex of $G$ is uniquely identified by its distances to the vertices of $R$. Introduced in the 1970s, this concept has been since then extensively studied from…

The first goal of the present paper is to study the class groups of the edge rings of complete multipartite graphs, denoted by $\Bbbk[K_{r_1,\ldots,r_n}]$, where $1 \leq r_1 \leq \cdots \leq r_n$. More concretely, we prove that the class…

Let $G$ be a finite graph on $[n]:=\{1, \ldots, n\}$ and $\kappa(G)$ its vertex connectivity. Let $S=K[x_1, \ldots, x_n]$ denote the polynomial ring in $n$ variables over a field $K$ and $I(G^c)$ the edge ideal of the complementary graph…

We introduce binomial edge ideals attached to a simple graph $G$ and study their algebraic properties. We characterize those graphs for which the quadratic generators form a Gr\"obner basis in a lexicographic order induced by a vertex…

Let $G$ be a simple graph with binomial edge ideal $J_G$. We prove how to calculate the multidegree of $J_G$ based on combinatorial properties of $G$. In particular, we study the set $S_{\min}(G)$ defined as the collection of subsets of…

We introduce a persistent commutative algebra for studying the algebraic and combinatorial evolution of edge ideals of graphs and hypergraphs under filtration. Building on the Persistent Stanley--Reisner Theory (PSRT), we develop the notion…

A geometric entropy is defined as the Riemannian volume of the parameter space of a statistical manifold associated with a given network. As such it can be a good candidate for measuring networks complexity. Here we investigate its ability…

In this paper we have used the idea of I-convergence of sequences and nets to study certain conditions of convergence in a topological space. It has been shown separately that a class of sequences and a class of nets in a non-empty set X…

Let $G$ be a finite group, and let ${\rm{cd}}(G)$ denote the set of degrees of the irreducible complex characters of $G$. The degree graph $\Delta(G)$ of $G$ is defined as the simple undirected graph whose vertex set ${\rm{V}}(G)$ consists…

If we know that some kind of sequence always converges, we can ask how quickly and how uniformly it converges. Many convergent sequences converge non-uniformly and, relatedly, have no computable rate of convergence. However proof-theoretic…

We examine the ideal $I=(x_1^2, \dots, x_n^2, (x_1+\dots+x_n)^2)$ in the polynomial ring $Q=k[x_1, \dots, x_n]$, where $k$ is a field of characteristic zero or greater than $n$. We also study the Gorenstein ideal $G$ linked to $I$ via the…

We give an upper bound for the Stanley depth of the edge ideal $I$ of a $k$-partite complete graph and show that Stanley's conjecture holds for $I$. Also we give an upper bound for the Stanley depth of the edge ideal of a $k$-uniform…

The chromatic number $\chi$ of a graph is bounded from below by its clique number $\omega,$ but it can be arbitrary large. Perfect graphs are defined by $\chi=\omega$ for all induced subgraphs. An interesting relaxation are $\chi$-bounded…

We create a framework for hereditary graph classes $\mathcal{G}^\delta$ built on a two-dimensional grid of vertices and edge sets defined by a triple $\delta=\{\alpha,\beta,\gamma\}$ of objects that define edges between consecutive columns,…

We consider two problems regarding vanishing patterns in the Betti table of edge ideals $I$ in polynomial algebra $S$. First, we show that the $j$-strand is connected if $j=3$ (for $j=2$ this is easy and known), and give examples where the…

Given integers $r$ and $b$ with $1 \leq b \leq r$, a finite simple connected graph $G$ for which ${\rm reg}(S/I(G)) = r$ and the number of extremal Betti numbers of $S/I(G)$ is equal to $b$ will be constructed.

The homological shift algebra and the projective dimension function of complementary edge ideals are investigated. Let $G$ be a connected graph, and let $I$ be its complementary edge ideal. For bipartite graphs $G$, we show that the…

An ideal $I$ of a local Gorenstein ring $(R, \mathfrak m)$ is called cohomologically complete intersection whenever $H^i_I(R) = 0$ for all $i \not= \height I.$ Here $H^i_I(R), i \in \mathbb Z,$ denotes the local cohomology of $R$ with…