3 citations · 4 across the 6 of their papers we have counts for
3 papers · 1 filter
Comparison of symbolic and ordinary powers of parity binomial edge ideals
Nadia Taghipour, Shamila Bayati, Farhad Rahmati
In this paper, we investigate when symbolic and ordinary powers of the parity binomial edge ideal of a graph fail to be equal. It turns out that if is the parity…
Shellable and Cohen-Macaulay complete t-partite graphs
Seyyede Masoome Seyyedi, Farhad Rahmati, Mahdis Saeedi
Let G be a simple undirected graph. We find the number of maximal independent sets in complete t-partite graphs. We will show that vertex decomposability and shellability are equiv…
Toricness of Binomial Edge Ideals
Mahdis Saeedi, Farhad Rahmati, Seyyede Masoome Seyyedi
Let G be a finite simple graph. In this paper we will show that the binomial edge ideal of G, JG is toric if and only if each connected component of G is complete and in this case…