
arXiv: 1601.01456
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 $Δ_{\mathcal{H}}$ for certain hypergraphs $\mathcal{H}$ in terms of the introduced matching numbers.
arXiv admin note: substantial text overlap with arXiv:1305.5954
13D02, 13P10, FOS: Mathematics, Mathematics - Commutative Algebra, Commutative Algebra (math.AC)
13D02, 13P10, FOS: Mathematics, Mathematics - Commutative Algebra, Commutative Algebra (math.AC)
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 1 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
