We introduce a family of graphs, which we call down-left graphs, and study their combinatorial
and algebraic properties. We show that members of this family are well-covered,
-free,
and vertex decomposable. By applying a result of Hà and Woodroofe,
and Moradi and Khosh-Ahang, the (Castelnuovo–Mumford) regularity
of the associated edge ideals is the induced matching number of the
graph. As an application, we give a combinatorial interpretation for
the regularity of the toric ideals of chordal bipartite graphs that are
-free.
PDF Access Denied
We have not been able to recognize your IP address
216.73.216.193
as that of a subscriber to this journal.
Online access to the content of recent issues is by
subscription, or purchase of single articles.
Please contact your institution's librarian suggesting a subscription, for example by using our
journal-recommendation form.
Or, visit our
subscription page
for instructions on purchasing a subscription.