نتایج جستجو برای: macaulay graph

تعداد نتایج: 199394  

Journal: :La Matematica 2021

We investigate Sharifan and Moradi’s closed neighborhood ideal of a finite simple graph, which is square-free monomial in polynomial ring over field. explicitly describe the minimal irreducible decompositions these ideals. also characterize trees whose ideals are Cohen–Macaulay; particular, this property for characteristic independent.

Journal: :Kybernetika 2004
Bernd Bank Marc Giusti Joos Heintz Luis M. Pardo

Let V be a closed algebraic subvariety of the n-dimensional projective space over the com­ plex or real numbers and suppose that V is non-empty and equidimensional. In this paper we generalize the classic notion of polar variety of V associated with a given linear subva­ riety of the ambient space of V. As particular instances of this new notion of generalized polar variety we reobtain the clas...

Journal: :Electr. J. Comb. 2016
Iván D. Castrillón Roberto Cruz Enrique Reyes

Let G = (V,E) be a graph. If G is a König graph or if G is a graph without 3-cycles and 5-cycles, we prove that the following conditions are equivalent: ∆G is pure shellable, R/I∆ is Cohen-Macaulay, G is an unmixed vertex decomposable graph and G is well-covered with a perfect matching of König type e1, . . . , eg without 4-cycles with two ei’s. Furthermore, we study vertex decomposable and she...

Journal: :Electronic Journal of Combinatorics 2023

The matching complex $M(G)$ of a graph G is the set all matchings in G. A Buchsbaum simplicial generalization both homology manifold and Cohen–Macaulay complex. We give complete characterization graphs for which two-dimensional As an intermediate step, we determine have complexes that are themselves connected graphs.

Journal: :Journal of Pure and Applied Algebra 2021

Let G be a simple graph on n vertices and JG denote the binomial edge ideal of in polynomial ring S=K[x1,…,xn,y1,…,yn]. In this article, we compute second graded Betti numbers JG, obtain minimal presentation it when is tree or unicyclic graph. We classify all graphs whose ideals are almost complete intersection, prove that they generated by d-sequence Rees algebra their Cohen-Macaulay. also an ...

Journal: :Electronic Journal of Combinatorics 2022

We introduce a new family of simple graphs, so called, growing graphs. investigate ways to modify given graph G combinatorially obtain graph. One may infinitely many graphs from single show that obtained any is Cohen–Macaulay and every chordal also prove under certain conditions, if only its clique complex grafted give several equivalent conditions in this case. Our work inspired by generalizes...

2011
HASSAN HAGHIGHI NAOKI TERAI SIAMAK YASSEMI

We introduce sequentially Sr modules over a commutative graded ring and sequentially Sr simplicial complexes. This generalizes two properties for modules and simplicial complexes: being sequentially Cohen-Macaulay, and satisfying Serre’s condition Sr . In analogy with the sequentially CohenMacaulay property, we show that a simplicial complex is sequentially Sr if and only if its pure i-skeleton...

Journal: :Journal of Algebra 2023

A very well–covered graph is an unmixed without isolated vertices such that the height of its edge ideal half number vertices. We study these graphs by means Betti splittings and mapping cone constructions. show cover ideals Cohen–Macaulay are splittable. As a consequence, we compute explicitly minimal graded free resolution class prove have homological linear quotients. Finally, conjecture sam...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید