2014/12/12 by Takayuki Hibi, Hibi, Takayuki, Akihiro Higashitani +5
Mathematics · #05C70 #Algebraic structures and combinatorial models #Combinatorics (math.CO) #Commutative Algebra (math.AC) #Commutative Algebra and Its Applications #FOS: Mathematics #Primary 05E40 #Rings, Modules, and Algebras #Secondary 05C69
paper · pdf · doi:10.48550/arxiv.1412.3881
openalex publication_date 2014/12/12 · openalex created_date 2019/06/27 · openalex updated_date 2026/07/28
The regularity of an 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 inuduced 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.