4 papers
Cycle algebras and polytopes of matroids
Tim Römer, Sara Saeedi Madani
Cycle polytopes of matroids have been introduced in combinatorial optimization as a generalization of important classes of polyhedral objects like cut polytopes and Eulerian subgra…
Induced matchings in strongly biconvex graphs and some algebraic applications
Sara Saeedi Madani, Dariush Kiani
In this paper, motivated by a question posed in \cite{AH}, we introduce strongly biconvex graphs as a subclass of weakly chordal and bipartite graphs. We give a linear time algorit…
Regularity of binomial edge ideals of chordal graphs
M. Rouzbahani Malayeri, S. Saeedi Madani, D. Kiani
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…
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…