نتایج جستجو برای: Cohen-Macaulay graph
تعداد نتایج: 208322 فیلتر نتایج به سال:
in this paper, we introduce a subclass of chordal graphs which contains $d$-trees and show that their complement are vertex decomposable and so is shellable and sequentially cohen-macaulay.
In this paper, we give some necessary conditions for an $r$-partite graph such that the edge ring of the graph is Cohen-Macaulay. It is proved that if there exists a cover of an $r$-partite Cohen-Macaulay graph by disjoint cliques of size $r$, then such a cover is unique.
in this paper, we give some necessary conditions for an $r$-partite graph such that the edge ring of the graph is cohen-macaulay. it is proved that if there exists a cover of an $r$-partite cohen-macaulay graph by disjoint cliques of size $r$, then such a cover is unique.
Let G be a simple undirected graph on n vertices, and let I(G) ⊆ R = k[x 1 ,. .. , x n ] denote its associated edge ideal. We show that all chordal graphs G are sequentially Cohen-Macaulay; our proof depends upon showing that the Alexander dual of I(G) is componentwise linear. Our result complements Faridi's theorem that the facet ideal of a simplicial tree is sequentially Cohen-Macaulay and im...
Let G be a simple undirected graph on n vertices, and let I(G) ⊆ R = k[x 1 ,. .. , x n ] denote its associated edge ideal. We show that all chordal graphs G are sequentially Cohen-Macaulay; our proof depends upon showing that the Alexander dual of I(G) is componentwise linear. Our result complements Faridi's theorem that the facet ideal of a simplicial tree is sequentially Cohen-Macaulay and He...
Let G be a simple undirected graph on n vertices, and let I(G) ⊆ R = k[x1, . . . , xn] denote its associated edge ideal. We show that all chordal graphs G are sequentially Cohen-Macaulay; our proof depends upon showing that the Alexander dual of I(G) is componentwise linear. Our result complements Faridi’s theorem that the facet ideal of a simplicial tree is sequentially Cohen-Macaulay and impl...
We characterize unmixed and Cohen-Macaulay edge-weighted edge ideals of very well-covered graphs. also provide examples oriented graphs that have non-Cohen-Macaulay vertex-weighted ideals, while the ideal their underlying graph is Cohen-Macaulay. This disproves a conjecture posed by Pitones, Reyes, Toledo.
Let [Formula: see text] be a simple undirected graph. The family of all matchings forms simplicial complex called the matching text]. Here, we give classification graphs with Gorenstein complex. Also study when is Cohen–Macaulay and, in certain classes graphs, fully characterize those which have In particular, graph girth at least five or complete Cohen–Macaulay.
Let D be a weighted oriented graph, whose underlying graph is G , and let I (D) its edge ideal. If has no 3-, 5-, or 7-cycles, K?nig, we characterize when unmixed. 3- 5-cycles, Cohen–Macaulay. We prove that unmixed if only Cohen–Macaulay girth greater than 7 K?nig 4-cycles.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید