Related papers: Some algebraic properties of hypergraphs

Let $G$ be a simple graph on $n$ vertices and $\mathcal{I}_G$ denotes parity binomial edge ideal of $G$ in the polynomial ring $S = \mathbb{K}[x_1,\ldots, x_n, y_1, \ldots, y_n].$ We obtain a lower bound for the regularity of parity…

We classify all graphs for which the Rees algebras of their edge ideals are normal and have regularity equal to their matching numbers.

A finite projective plane, or more generally a finite linear space, has an associated incidence complex that gives rise to two natural algebras: the Stanley-Reisner ring $R/I_\Lambda$ and the inverse system algebra $R/I_\Delta$. We give a…

Let a_1,...,a_k satisfy a_1+...+a_k=1 and suppose a k-uniform hypergraph on n vertices satisfies the following property; in any partition of its vertices into k sets A_1,...,A_k of sizes a_1*n,...,a_k*n, the number of edges intersecting…

Let $\operatorname{pd}(I(G))$ and $\operatorname{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…

For real application and theoretical investigation of ordinary hypergraphs and non-ordinary hypergraphs, researchers need to establish standard rules and feasible operating methods. We propose a visualization tool for investigating…

The analysis of large simple graphs with extreme values of the densities of edges and triangles has been extended to the statistical structure of typical graphs of fixed intermediate densities, by the use of large deviations of Erdoes-Renyi…

Hypergraphs are a generalization of graphs in which edges can connect any number of vertices. They allow the modeling of complex networks with higher-order interactions, and their spectral theory studies the qualitative properties that can…

Let $G$ be a simple graph on the vertex set $[n]$ and $J_G$ be the corresponding binomial edge ideal. Let $G=v*H$ be the cone of $v$ on $H$. In this article, we compute all the Betti numbers of $J_G$ in terms of Betti number of $J_H$ and as…

An intuitive property of a random graph is that its subgraphs should also appear randomly distributed. We consider graphs whose subgraph densities exactly match their expected values. We call graphs with this property for all subgraphs with…

Edge ideals of graphs were introduced by Villarreal in 1990, and have been the subject of many studies since then. In the same year, Fr\"oberg characterized edge ideals with regularity 2 in combinatorial terms. This result was generalized…

In this article, we characterize the class of complementary edge ideals which satisfy the licci property in terms of the underlying graph. Using this characterization, we associate the licci property of a complementary edge ideal to its…

In this article, we compute the regularity of Rees algebra of binomial edge ideals of closed graphs. We obtain a lower bound for the regularity of Rees algebra of binomial edge ideals. We also study some algebraic properties of the Rees…

In this paper we study depth and Stanley depth of the edge ideals and quotient rings of the edge ideals, associated to classes of graphs obtained by taking the strong product of two graphs. We consider the cases when either both graphs are…

We classify all complete uniform multipartite hypergraphs with respect to some algebraic properties, such as being (almost) complete intersection, Gorenstein, level, $l$-Cohen-Macaulay, $l$-Buchsbaum, unmixed, and satisfying Serre's…

We compute the graded Betti numbers for the toric ideal of a family of graphs constructed by adjoining a cycle to a complete bipartite graph. The key observation is that this family admits an initial ideal which has linear quotients. As a…

A hypergraph $H=(V,E)$, where $V=\{x_1,...,x_n\}$ and $E\subseteq 2^V$ defines a hypergraph algebra $R_H=k[x_1,...,x_n]/(x_{i_1}... x_{i_k}; \{i_1,...,i_k\}\in E)$. All our hypergraphs are $d$-uniform, i.e., $|e_i|=d$ for all $e_i\in E$. We…

Let $G$ be a graph and $I(G)$ its edge ideal. In this paper, we give a complete characterization of the graphs $G$ for which $\reg(R/I(G)) = 3$.

Let $G$ be a finite simple graph on $n$ vertices. Let $J_G \subset K[x_1, \ldots, x_n]$ be the cover ideal of $G$. In this article, we obtain syzygies, Betti numbers and Castelnuovo-Mumford regularity of $J_G^s$ for all $s \geq 1$ for…

We say that a $k$-uniform hypergraph $C$ is a Hamilton cycle of type $\ell$, for some $1\le \ell \le k$, if there exists a cyclic ordering of the vertices of $C$ such that every edge consists of $k$ consecutive vertices and for every pair…