Induced matchings in strongly biconvex graphs and some algebraic applications
DOI10.1002/mana.201900472arXiv1905.02640OpenAlexW3151013307MaRDI QIDQ6081912
Dariush Kiani, Sara Saeedi Madani
Publication date: 5 October 2023
Published in: Mathematische Nachrichten (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1905.02640
extremal Betti numbersmaximum induced matchingmonomial and binomial edge idealsstrongly biconvex graph
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Syzygies, resolutions, complexes and commutative rings (13D02) Combinatorial aspects of commutative algebra (05E40)
Related Items (1)
Cites Work
- Matchings, coverings, and Castelnuovo-Mumford regularity
- Binomial edge ideals of graphs
- Linearity defect of edge ideals and Fröberg's theorem
- Square-free Gröbner degenerations
- Binomial edge ideals and conditional independence statements
- Maximum induced matchings for chordal graphs in linear time
- Biconvex graphs: Ordering and algorithms
- On the extremal Betti numbers of binomial edge ideals of block graphs
- Finding a maximum induced matching in weakly chordal graphs
- A linear time algorithm for maximum matchings in convex, bipartite graphs
- New results on maximum induced matchings in bipartite graphs and beyond
- New results on induced matchings
- Extremal Betti numbers of edge ideals
- Characteristic-independence of Betti numbers of graph ideals
- Monomial ideals, edge ideals of hypergraphs, and their graded Betti numbers
- Nonvanishing of Betti Numbers of Edge Ideals and Complete Bipartite Subgraphs
- Graphs and Ideals Generated by Some 2-Minors
- Cohen-Macaulay binomial edge ideals
- Minimizing flow time in the wireless gathering problem
- On the np-completeness of certain network testing problems
- On the extremal Betti numbers of the binomial edge ideal of closed graphs
This page was built for publication: Induced matchings in strongly biconvex graphs and some algebraic applications
