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.
No takes yet. Share an insight, caveat, or question.
Matsuda et al. (2013) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: