Dominating induced matchings of finite graphs and regularity of edge ideals
From MaRDI portal
Publication:5964813
DOI10.1007/s10801-015-0632-zzbMath1331.05239arXiv1412.3881OpenAlexW1946503909MaRDI QIDQ5964813
Akihiro Higashitani, Akiyoshi Tsuchiya, Takayuki Hibi, Kyouko Kimura
Publication date: 1 March 2016
Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1412.3881
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Combinatorial aspects of commutative algebra (05E40)
Related Items (10)
Joins, ears and Castelnuovo-Mumford regularity ⋮ Improved bounds for the regularity of powers of edge ideals of graphs ⋮ Regularity of powers of bipartite graphs ⋮ Prime graphs, matchings and the Castelnuovo-Mumford regularity ⋮ Improved bounds for the regularity of edge ideals of graphs ⋮ Upper bounds for the regularity of powers of edge ideals of graphs ⋮ Induced matching numbers of finite graphs and edge ideals ⋮ Regularity of bicyclic graphs and their powers ⋮ Matching numbers and dimension of edge ideals ⋮ Regularity and Gröbner bases of the Rees algebra of edge ideals of bipartite graphs
Cites Work
- Bounds on the regularity and projective dimension of ideals associated to graphs
- Vertex-decomposable graphs, codismantlability, Cohen-Macaulayness, and Castelnuovo-Mumford regularity
- Matchings, coverings, and Castelnuovo-Mumford regularity
- Algebraic study on Cameron-Walker graphs
- Exact algorithms for minimum weighted dominating induced matching
- Regularity of edge ideals of \(C_{4}\)-free graphs via the topology of the lcm-lattice
- Vertex decomposability and regularity of very well-covered graphs
- Intersections of Leray complexes and regularity of monomial ideals
- Regularity, depth and arithmetic rank of bipartite edge ideals
- Sequentially Cohen-Macaulay bipartite graphs: Vertex decomposability and regularity
- A new explicit finite free resolution of ideals generated by monomials in an R-sequence
- Characteristic-independence of Betti numbers of graph ideals
- Monomial ideals, edge ideals of hypergraphs, and their graded Betti numbers
- The graphs with maximum induced matching and maximum matching the same size
- Non-vanishingness of Betti Numbers of Edge Ideals
- Resolutions of Facet Ideals
- Vertex decomposable graphs and obstructions to shellability
- Sequentially Cohen-Macaulay edge ideals
- Regularity and projective dimension of the edge ideal of $C_5$-free vertex decomposable graphs
- Bounds For Invariants of Edge-Rings
This page was built for publication: Dominating induced matchings of finite graphs and regularity of edge ideals
