paper

Induced matching numbers of finite graphs and edge ideals

arXiv:1902.10429

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 .

arXiv comment11 pages

References in corpus (2)

Cited by in corpus (1)