Skip to main content
Log in

Dominating induced matchings of finite graphs and regularity of edge ideals

  • Published:
Journal of Algebraic Combinatorics Aims and scope Submit manuscript

Abstract

The regularity of the edge ideal of a finite simple graph G is at least the induced matching number of G and is at most the minimum matching number of G. If G possesses a dominating induced matching, i.e. an induced matching which forms a maximal matching, then the induced matching number of G is equal to the minimum matching number of G. In the present paper, from viewpoints of both combinatorics and commutative algebra, finite simple graphs with dominating induced matchings will be mainly studied.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

References

  1. Biyikoğlu, T., Civan, Y.: Vertex decomposable graphs, codismantlability, Cohen–Macaulayness and Castelnuovo–Mumford regularity. Electron. J. Combin. 21 (2014)

  2. Biyikoğlu, T., Civan, Y.: Bounding Castelnuovo–Mumford Regularity of Graphs Via Lozin’s Transformation, preprint, arXiv:1302.3064v1

  3. Biyikoğlu, T., Civan, Y.: Castelnuovo–Mumford Regularity of Graphs, preprint, arXiv:1503.06018

  4. Cameron, K., Walker, T.: The graphs with maximum induced matching and maximum matching the same size. Discrete Math. 299, 49–55 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  5. Cardoso, D.M., Martins, E.A., Media, L., Rojo, O.: Spectral Results for the Dominating Induced Matching Problem, preprint, arXiv:1311.2748v1

  6. Dao, H., Huneke, C., Schweig, J.: Bounds on the regularity and projective dimension of ideals associated to graphs. J. Algebraic Combin. 38, 37–55 (2013)

    Article  MATH  MathSciNet  Google Scholar 

  7. Francisco, C.A., Van Tuyl, A.: Sequentially Cohen–Macaulay edge ideals. Proc. Am. Math. Soc. 135, 2327–2337 (2007)

    Article  MATH  Google Scholar 

  8. Gitler, I., Valencia, C.E.: Bounds for invariants of edge-rings. Comm. Algebra 33, 1603–1616 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  9. Hà, H.T., Van Tuyl, A.: Monomial ideals, edge ideals of hypergraphs, and their graded Betti numbers. J. Algebraic Combin. 27, 215–245 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  10. Hibi, T., Higashitani, A., Kimura, K., O’Keefe, A.B.: Algebraic study on Cameron–Walker graphs. J. Algebra 422, 257–269 (2015)

    Article  MATH  MathSciNet  Google Scholar 

  11. Kalai, G., Meshulam, R.: Intersections of Leray complexes and regularity of monomial ideals. J. Combin. Theory Ser. A 113, 1586–1592 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  12. Katzman, M.: Characteristic-independence of Betti numbers of graph ideals. J. Combin. Theory Ser. A. 113, 435–454 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  13. Khosh-Ahang, F., Moradi, S.: Regularity and projective dimension of edge ideal of \(C_5\)-free vertex decomposable graphs. Proc. Am. Math. Soc. 142, 1567–1576 (2014)

    Article  MATH  MathSciNet  Google Scholar 

  14. Kimura, K.: Non-vanishingness of Betti numbers of edge ideals. In: Harmony of Gröbner Bases and the Modern Industrial Society, pp. 153–168. World Scientific, Singapore (2012)

  15. Kummini, M.: Regularity, depth and arithmetic rank of bipartite edge ideals. J. Algebraic Combin. 30, 429–445 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  16. Lin, M.C., Mizrahi, M.J., Szwarcfiter, J. L.: Exact Algorithms for Dominating Induced Matchings, preprint, arXiv:1301.7602v2

  17. Lyubeznik, G.: A new explicit finite free resolution of ideals generated by monomials in an \(R\)-sequence. J. Pure Appl. Algebra 51, 193–195 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  18. Mahmoudi, M., Mousivand, A., Crupi, M., Rinaldo, G., Terai, N., Yassemi, S.: Vertex decomposability and regularity of very well-covered graphs. J. Pure Appl. Algebra 215, 2473–2480 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  19. Nevo, E.: Regularity of edge ideals of \(C_4\)-free graphs via the topology of the lcm-lattice. J. Combin. Theory Ser. A 118, 491–501 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  20. Van Tuyl, A.: Sequentially Cohen–Macaulay bipartite graphs: vertex decomposability and regularity. Arch. Math. (Basel) 93, 451–459 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  21. Woodroofe, R.: Vertex decomposable graphs and obstructions to shellability. Proc. Am. Math. Soc. 137, 3235–3246 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  22. Woodroofe, R.: Matchings, coverings, and Castelnuovo–Mumford regularity. J. Commut. Algebra 6, 287–304 (2014)

    Article  MATH  MathSciNet  Google Scholar 

  23. Zheng, X.: Resolutions of facet ideals. Comm. Algebra 32, 2301–2324 (2004)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Acknowledgments

The third author is partially supported by JSPS Grant-in-Aid for Young Scientists (B) 24740008. We thank the anonymous referees for reading the manuscript carefully.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Kyouko Kimura.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Hibi, T., Higashitani, A., Kimura, K. et al. Dominating induced matchings of finite graphs and regularity of edge ideals. J Algebr Comb 43, 173–198 (2016). https://doi.org/10.1007/s10801-015-0632-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10801-015-0632-z

Keywords

Mathematics Subject Classification

Navigation