Induced matching, ordered matching and Castelnuovo-Mumford regularity of bipartite graphs
Algebraic Combinatorics · 03.03.2026 · 9 (1) · 41-50
DOI: 10.5802/alco.461 ↗Kurz gefasst
Fachartikel in der Zeitschrift Algebraic Combinatorics, online erschienen am 03.03.2026. Verfasst von A. V. Jayanthan und 3 weiteren Autor:innen. Die Arbeit nennt 21 Literaturangaben.
Abstract (Originalsprache)
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.
Zitieren
APA
Jayanthan, A. V., Fakhari, S. A. S., Swanson, I., & Yassemi, S. (2026). Induced matching, ordered matching and Castelnuovo-Mumford regularity of bipartite graphs. Algebraic Combinatorics, 9(1), 41-50. https://doi.org/10.5802/alco.461
Vancouver
Jayanthan AV, Fakhari SAS, Swanson I, Yassemi S. Induced matching, ordered matching and Castelnuovo-Mumford regularity of bipartite graphs. Algebraic Combinatorics. 2026;9(1):41-50. doi:10.5802/alco.461
BibTeX
@article{Jayanthan2026,
author = {Jayanthan, A. V. and Fakhari, Seyed Amin Seyed and Swanson, Irena and Yassemi, Siamak},
title = {Induced matching, ordered matching and Castelnuovo-Mumford regularity of bipartite graphs},
journal = {Algebraic Combinatorics},
year = {2026},
volume = {9},
number = {1},
pages = {41--50},
doi = {10.5802/alco.461}
}
EUVIMED