Induced matching, ordered matching and Castelnuovo-Mumford regularity of bipartite graphs

Algebraic Combinatorics 2026 Open access

Read full text
Authors: A. V. Jayanthan, S. A. Seyed Fakhari, Irena Swanson, Siamak Yassemi
DOI: 10.5802/alco.461
Cited by: 0
References: 21

Abstract

Let G be a finite simple graph and let ind-match ( G ) and ord-match ( G ) denote the induced matching number and the ordered matching number of G , respectively. We characterize all bipartite graphs G with ind-match ( G ) = ord-match ( G ) . We establish the Castelnuovo-Mumford regularity of powers of edge ideals and depth of powers of cover ideals for such graphs.

Fields of Study & Subjects

Commutative Algebra and Its Applications Limits and Structures in Graph Theory Advanced Combinatorial Mathematics

Publication details

Journal / source
Algebraic Combinatorics
Volume
9
Issue
1
Pages
41–50
Publication date
3 March 2026
Language
EN