Matching numbers and dimension of edge ideals

DOI10.1007/S00373-021-02277-XMaRDI QIDQ2045372zbMATH OpenOpenAlexFDO

Authors Ayana Hirano, Kazunori Matsuda

Publication date 12 August 2021

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2001.10704

zbMATH Keywords

edge idealindependent setmatching numberinduced matching numberminimum matching number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Combinatorial aspects of commutative algebra (05E40) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Dimension theory, depth, related commutative rings (catenary, etc.) (13C15)

Abstract: Let $G$ be a finite simple graph on the vertex set $V(G)=x_1,ldots,x_n$ and match$(G)$, min-match$(G)$ and ind-match$(G)$ the matching number, minimum matching number and induced matching number of $G$, respectively. Let $K[V(G)]=K[x_1,ldots,x_n]$ denote the polynomial ring over a field $K$ and $I(G)subsetK[V(G)]$ the edge ideal of $G$. The relationship between these graph-theoretic invariants and ring-theoretic invariants of the quotient ring $K[V(G)]/I(G)$ has been studied. In the present paper, we study the relationship between match$(G)$, min-match$(G)$, ind-match$(G)$ and $dimK[V(G)]/I(G)$.

Recommendations

• Induced matching numbers of finite graphs and edge ideals
• Dominating induced matchings of finite graphs and regularity of edge ideals
• Matchings and squarefree powers of edge ideals
• Improved bounds for the regularity of edge ideals of graphs
• Matching numbers and the regularity of the Rees algebra of an edge ideal

Cites work

• scientific article; zbMATH DE number 1565322 (Why is no real title available?)
• Algebraic study on Cameron-Walker graphs
• Characteristic-independence of Betti numbers of graph ideals
• Computational methods of commutative algebra and algebraic geometry. With chapters by David Eisenbud, Daniel R. Grayson, Jürgen Herzog and Michael Stillman
• Dominating induced matchings of finite graphs and regularity of edge ideals
• Induced matching numbers of finite graphs and edge ideals
• Many toric ideals generated by quadratic binomials possess no quadratic Gröbner bases
• Matchings, coverings, and Castelnuovo-Mumford regularity
• Regularity and \(h\)-polynomials of edge ideals
• Regularity, matchings and Cameron-Walker graphs
• Resolutions of square-free monomial ideals via facet ideals: a survey
• The graphs with maximum induced matching and maximum matching the same size

Cited in

(6)

• Edge ideals of squares of trees
• Some algebraic Invariants of the residue class rings of the edge ideals of perfect semiregular trees
• Bounds For Invariants of Edge-Rings
• Matchings and squarefree powers of edge ideals
• Induced matching numbers of finite graphs and edge ideals
• Dominating induced matchings of finite graphs and regularity of edge ideals

This page was built for publication: Matching numbers and dimension of edge ideals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2045372)