Related papers: Betti numbers of weighted oriented graphs

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…

Given a finite simple graph one can associate the edge ideal. In this paper we prove that a graded Betti number of the edge ideal does not vanish if the original graph contains a set of complete bipartite subgraphs with some conditions.…

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…

Boij-S\"{o}derberg Theory views the Betti diagrams of graded modules over polynomial rings as vectors in a rational vector space, and studies the cone that these vectors generate (called a 'Betti Cone'). The objects of study in this paper…

This paper investigates the rational Betti numbers of real toric manifolds associated with chordal nestohedra. We consider the poset topology of a specific poset induced from a chordal building set, and show its EL-shellability. Based on…

The maximum number of edges in a graph with matching number m and maximum degree d has been determined in [1] and [2], where some extremal graphs have also been provided. Then, a new question has emerged: how the maximum edge count is…

Discrete curvatures are quantities associated to the nodes and edges of a graph that reflect the local geometry around them. These curvatures have a rich mathematical theory and they have recently found success as a tool to analyze networks…

The independence complex of a chordal graph is known to be shellable due to a result of Van Tuyl and Villarreal. This is equivalent to the fact that cover ideal of a chordal graph has linear quotients. We use this result to obtain recursive…

In this paper we study the Betti numbers of Stanley-Reisner ideals generated in degree 2. We show that the first six Betti numbers do not depend on the characteristic of the ground field. We also show that, if the number of variables $n$ is…

Let $T$ be a perfect binary tree and $I$ be its edge ideal in the polynomial ring $S$. We determine the vertex cover number, independent number, and establish the recursive formula to compute the number of minimal vertex covers. As a…

We introduce and study the weighted $r$-path ideal of a weighted graph $G_\omega$, which is a common generalization of Conca and De Negri's $r$-path ideal for unweighted graphs and Paulsen and Sather-Wagstaff's edge ideal of the weighted…

This paper studies reduced-order modeling of dynamic networks with strongly connected topology. Given a graph clustering of an original complex network, we construct a quotient graph with less number of vertices, where the edge weights are…

In this paper, we introduce new combinatorial invariants of any finite simple graph, which arise in toric topology. We compute the $i$-th (rational) Betti number and Euler characteristic of the real toric variety associated to a graph…

In this article, we study algebraic properties of binomial edge ideals of Levi graphs associated with certain plane curve arrangements. Using combinatorial properties of Levi graphs, we discuss the Cohen-Macaulayness of binomial edge ideals…

This research focuses on analyzing the depth of generalized binomial edge ideals. We extend the notion of $d$-compatible map for the pairs of a complete graph and an arbitrary graph, and using it, we give a combinatorial lower bound for the…

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 paper we study the resolution of a facet ideal associated with a special class of simplicial complexes introduced by S. Faridi. These simplicial complexes are called trees, and are a generalization (to higher dimensions) of the…

Let $G$ be a simple graph on $n$ vertices. Let $L_G \text{ and } \mathcal{I}_G \: $ denote the Lov\'asz-Saks-Schrijver(LSS) ideal and parity binomial edge ideal of $G$ in the polynomial ring $S = \mathbb{K}[x_1,\ldots, x_n, y_1, \ldots,…

We present various facts on the graded Betti table of a projectively embedded toric surface, expressed in terms of the combinatorics of its defining lattice polygon. These facts include explicit formulas for a number of entries, as well as…

Computing maximum weight independent sets in graphs is an important NP-hard optimization problem. The problem is particularly difficult to solve in large graphs for which data reduction techniques do not work well. To be more precise,…