اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدThe facet ideals of matching complexes of line graphs
142
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Let $L_n$ be a line graph with $n$ edges and $F(L_n)$ the facet ideal of its matching complex. In this paper, we provide the irreducible decomposition of $F(L_n)$ and some exact formulas for the projective dimension and the regularity of $F(L_n)$.
قيم البحث
اقرأ أيضاً
Let $G$ be a finite simple graph on the vertex set $V(G) = {x_1, ldots, x_n}$ and $I(G) subset K[V(G)]$ its edge ideal, where $K[V(G)]$ is the polynomial ring in $x_1, ldots, x_n$ over a field $K$ with each ${rm deg} x_i = 1$ and where $I(G)$ is gene
rated by those squarefree quadratic monomials $x_ix_j$ for which ${x_i, x_j}$ is an edge of $G$. In the present paper, given integers $1 leq a leq r$ and $s geq 1$, the existence of a finite connected simple graph $G = G(a, r, d)$ with ${rm im}(G) = a$, ${rm reg}(R/I(G)) = r$ and ${rm deg} h_{K[V(G)]/I(G)} (lambda) = s$, where ${rm im}(G)$ is the induced matching number of $G$ and where $h_{K[V(G)]/I(G)} (lambda)$ is the $h$-polynomial of $K[V(G)]/I(G)$.
Let $I_G$ be the toric ideal of a graph $G$. We characterize in graph theoretical terms the primitive, the minimal, the indispensable and the fundamental binomials of the toric ideal $I_G$.
In this paper we prove the conjectured upper bound for Castelnuovo-Mumford regularity of binomial edge ideals posed in [23], in the case of chordal graphs. Indeed, we show that the regularity of any chordal graph G is bounded above by the number of m
aximal cliques of G, denoted by c(G). Moreover, we classify all chordal graphs G for which L(G) = c(G), where L(G) is the sum of the lengths of longest induced paths of connected components of G. We call such graphs strongly interval graphs. Moreover, we show that the regularity of a strongly interval graph G coincides with L(G) as well as c(G).
Our purpose is to study the family of simple undirected graphs whose toric ideal is a complete intersection from both an algorithmic and a combinatorial point of view. We obtain a polynomial time algorithm that, given a graph $G$, checks whether its
toric ideal $P_G$ is a complete intersection or not. Whenever $P_G$ is a complete intersection, the algorithm also returns a minimal set of generators of $P_G$. Moreover, we prove that if $G$ is a connected graph and $P_G$ is a complete intersection, then there exist two induced subgraphs $R$ and $C$ of $G$ such that the vertex set $V(G)$ of $G$ is the disjoint union of $V(R)$ and $V(C)$, where $R$ is a bipartite ring graph and $C$ is either the empty graph, an odd primitive cycle, or consists of two odd primitive cycles properly connected. Finally, if $R$ is $2$-connected and $C$ is connected, we list the families of graphs whose toric ideals are complete intersection.
Let $mathcal{D}$ be a weighted oriented graph and $I(mathcal{D})$ be its edge ideal. In this paper, we show that all the symbolic and ordinary powers of $I(mathcal{D})$ coincide when $mathcal{D}$ is a weighted oriented certain class of tree. Fi
nally, we give necessary and sufficient conditions for the equality of ordinary and symbolic powers of naturally oriented lines.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
