We construct an explicit DG algebra structure on the minimal free resolution of the quotient of a polynomial ring by the edge ideal of any split graph (that is, a graph whose vertex set is a disjoint union of a clique and an independent set). The algebra structure is based on a simple combinatorial notion, which we call the fixing edge of a pair of edges, that directly captures the structure of the underlying graph. Our construction involves an explicit description of the minimal free resolution of the edge ideal of such a graph, including formulas for both the Betti numbers and the differentials.
We generalize a construction of Herzog and Takayama pertaining to differential graded algebra structures on mapping cones. Via this generalization, we provide the minimal free resolution of the edge ideal of a new graph built from suspension over a vertex cover of an old graph, and we discuss when this process preserve...
Hugh Geller, Desiree Martin, Matthew Mastroeni et al.· 0 citations
We show that all normal covers of a fixed finite graph $G$ sitting between the universal and maximal abelian covers share the same atomic part of their spectral measures. We give an explicit double formula for the mass of atoms which generalises and unifies known results on universal covering trees and maximal abelian...
Charles Bordenave, Wen-Bo Li, Joe Thomas· 0 citations
In this article, we compute the Hilbert series of the generalized binomial edge ideal associated with the join of two graphs. Consequently, we compute the Hilbert series of complete $r$-partite graphs. Further, we show that if a vertex satisfies a certain degree condition, then some Hilbert coefficients remain unchange...
We study the depth of symbolic powers of edge ideals, focusing on local properties of graphs. First, we give several sufficient conditions for the symbolic depth function to be non-increasing, using local properties of graphs and local cohomology. Next, we give a counterexample to a conjecture of Minh, T.N. Trung, and...
The finite simple graphs with vertices in a set S form an algebra G(S) under union and join, generated by the one-vertex graphs. We show that this algebra has a canonical normal form whose data are exactly the maximal cliques of the graph. Precisely, every g∈G(S) admits a unique maximal-clique decomposition μ(g), chara...
B. Sarma, Gete Umbrey, M. Enduri· Mathematics· 0 citations
We study locally finite graphs whose normalized adjacency operators belong to the C*-algebra T, the norm closure of the algebra of l1-bounded operators. We give sufficient and necessary conditions in terms of the degrees of adjacent vertices, prove stability results under finite edge perturbations and Cartesian product...
V. Manuilov· Mathematics· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.