Induced matching, ordered matching and Castelnuovo-Mumford regularity of
bipartite graphs
Induced matching, ordered matching and Castelnuovo-Mumford regularity of
bipartite graphs
Let G be a finite simple graph and let indm(G) and ordm(G) denote the induced matching number and the ordered matching number of G, respectively. We characterize all bipartite graphs G with indm(G) = ordm(G). We establish the Castelnuovo-Mumford regularity of powers of edge ideals and depth of powers of …