Regularity Bounds for Binomial Edge Ideals

@inproceedings{Matsuda2013RegularityBF,
  title={Regularity Bounds for Binomial Edge Ideals},
  author={Kazunori Matsuda and Satoshi Murai},
  year={2013}
}
We show that the Castelnuovo–Mumford regularity of the binomial edge ideal of a graph is bounded below by the length of its longest induced path and bounded above by the number of its vertices. 

From This Paper

Topics from this paper.
12 Citations
8 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-8 of 8 references

Graphs and ideals generated by some 2-minors

  • M. Ohtani
  • Comm. Algebra
  • 2011
Highly Influential
3 Excerpts

Graded syzygies

  • I. Peeva
  • Algebra and Applications,
  • 2011

Binomial edge ideals and conditional independence statements

  • J. Herzog, T. Hibi, F. Hreinsdóttir, T. Kahle, J. Rauh
  • Adv. in Appl. Math
  • 2010
2 Excerpts

Binomial edge ideals and conditional independence statements , Adv

  • D. Grayson, M. Stillman, +4 authors J. Rauh
  • Appl . Math .
  • 2010

Graph Theory, Fourth Edition

  • R. Diestel
  • Graduate Texts in Mathematics 173,
  • 2010
1 Excerpt

Cohen–Macaulay rings, Revised Edition

  • W. Bruns, J. Herzog
  • 1998

A new explicit finite free resolution of ideals generated by monomials in an R-sequence

  • G. Lyubeznik
  • J. Pure Appl. Algebra
  • 1988
1 Excerpt

Similar Papers

Loading similar papers…