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.
机构:
Ovidius Univ, Fac Math & Comp Sci, Constanta 900527, Romania
Romanian Acad, Res Grp Project ID PCE 2011 1023, Simion Stoilow Inst Math, Bucharest 014700, RomaniaOvidius Univ, Fac Math & Comp Sci, Constanta 900527, Romania
Ene, Viviana
Zarojanu, Andrei
论文数: 0引用数: 0
h-index: 0
机构:
Univ Bucharest, Fac Math & Comp Sci, Bucharest, Romania
Romanian Acad, Res Grp Project ID PCE 2011 1023, Simion Stoilow Inst Math, Bucharest 014700, RomaniaOvidius Univ, Fac Math & Comp Sci, Constanta 900527, Romania
机构:
Indian Inst Technol Madras, Dept Math, Chennai 600036, Tamil Nadu, India
Chennai Math Inst, Dept Math, Chennai 603103, Tamil Nadu, IndiaIndian Inst Technol Madras, Dept Math, Chennai 600036, Tamil Nadu, India