2000 character limit reached
Induced matching, ordered matching and Castelnuovo-Mumford regularity of bipartite graphs (2405.06781v2)
Published 10 May 2024 in math.AC
Abstract: 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 cover ideals for such graphs. We also give formulas for the count of connected non-isomorphic spanning subgraphs of the complete bipartite graph K_{m,n} for which indm(G) = ordm(G) = 2, with an explicit expression for the count when m = 2,3,4 and m <= n.
- Markus Brodmann. The asymptotic nature of the analytic spread. Math. Proc. Cambridge Philos. Soc. 86 (1) (1979), 35–39.
- Kathie Cameron and Tracy Walker. The graphs with maximum induced matching and maximum matching the same size. Discrete Math. 299 (1-3) (2005), 49–55.
- Christopher A. Francisco and Huy Tài Hà. Whiskers and sequentially Cohen-Macaulay graphs. J. Combin. Theory Ser. A 115 (2) (2008), 304–316.
- Mordechai Katzman. Characteristic-independence of Betti numbers of graph ideals. J. Combin. Theory Ser. A 113 (3) (2006), 435–454.
- Rudolf Lidl and Harald Niederreiter. Introduction to finite fields and their applications. Cambridge University Press, 1986.
- Seyed Amin Seyed Fakhari. Depth and stanley depth of symbolic powers of cover ideals of graphs. J. Algebra 492 (2017), 402–413.
- Seyed Amin Seyed Fakhari and Siamak Yassemi. Improved bounds for the regularity of powers of edge ideals of graphs. J. Commut. Algebra 15 (1) (2023), 85–98.
- Adam Van Tuyl. Sequentially Cohen-Macaulay bipartite graphs: vertex decomposability and regularity. Arch. Math. (Basel) 93 (5) (2009), 451–459.
- Rafael H. Villarreal. Cohen-Macaulay graphs. Manuscripta Math. 66 (3) (1990), 277–293.