arXiv Analytics

Sign in

arXiv:1401.4817 [math.CO]AbstractReferencesReviewsResources

Binomial edge ideals with pure resolutions

Dariush Kiani, Sara Saeedi Madani

Published 2014-01-20Version 1

We characterize all graphs whose binomial edge ideals have pure resolutions. Moreover, we introduce a new switching of graphs which does not change some algebraic invariants of graphs, and using this, we study the linear strand of the binomial edge ideals for some classes of graphs. Also, we pose a conjecture on the linear strand of such ideals for every graph.

Comments: 10 pages, 8 figures, To appear in Collectanea Math
Categories: math.CO, math.AC
Subjects: 05E40, 05C25, 16E05, 13C05
Related articles: Most relevant | Search more
arXiv:1306.2930 [math.CO] (Published 2013-06-12, updated 2015-08-01)
Another proof of Wilmes' conjecture
arXiv:0812.3082 [math.CO] (Published 2008-12-16)
Algebraic invariants of graphs; a study based on computer exploration
arXiv:1305.6482 [math.CO] (Published 2013-05-28, updated 2013-11-04)
A new result on the problem of Buratti, Horak and Rosa

Links

Toolbox