D. Kiani

activity

20152022

most citedA proof for a conjecture on the regularity of binomial edge ideals

2 citations · 3 across the 4 of their papers we have counts for

collaborators

Showing 2015Show all

3 papers · 1 filter

math.AC2015

Some Cohen-Macaulay and unmixed binomial edge ideals

Dariush Kiani, Sara Saeedi Madani

We study unmixed and Cohen-Macaulay properties of the binomial edge ideal of some classes of graphs. We compute the depth of the binomial edge ideal of a generalized block graph. W…

math.CO2015

Cohen-Macaulay and Gorenstein path ideals of trees

Sara Saeedi Madani, Dariush Kiani

Let $R = k [x_{1}, \dots, x_{n}]$ , where $k$ is a field. The path ideal (of length $t \geq 2$ ) of a directed graph $G$ is the monomial ideal, denoted by $I_{t} (G)$ , whose generators cor…

math.AC2015★ 1 cited

The Castelnuovo-Mumford regularity of binomial edge ideals

Dariush Kiani, Sara Saeedi Madani

We prove a conjectured upper bound for the Castelnuovo-Mumford regularity of binomial edge ideals of graphs, due to Matsuda and Murai. Indeed, we prove that $\mathrm{reg}(J_G)\leq…