Matchings in hypergraphs and Castelnuovo-Mumford regularity
arXiv:1601.01456
Abstract
In this paper, we introduce and generalize some combinatorial invariants of graphs such as matching number and induced matching number to hypergraphs. Then we compare them together and present some upper bounds for the regularity of Stanley-Reisner ring of for certain hypergraphs in terms of the introduced matching numbers.
arXiv admin note: substantial text overlap with arXiv:1305.5954