Induced matching numbers of finite graphs and edge ideals
Commutative Algebra
2019-02-28 v1 Combinatorics
Abstract
Let be a finite simple graph on the vertex set and its edge ideal, where is the polynomial ring in over a field with each and where is generated by those squarefree quadratic monomials for which is an edge of . In the present paper, given integers and , the existence of a finite connected simple graph with , and , where is the induced matching number of and where is the -polynomial of .
Keywords
Cite
@article{arxiv.1902.10429,
title = {Induced matching numbers of finite graphs and edge ideals},
author = {Takayuki Hibi and Hiroju Kanno and Kazunori Matsuda},
journal= {arXiv preprint arXiv:1902.10429},
year = {2019}
}
Comments
11 pages