arXiv · 1601.01456
Matchings in hypergraphs and Castelnuovo-Mumford regularity
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 $\Delta_{\mathcal{H}}$ for certain hypergraphs $\mathcal{H}$ in terms of the introduced matching numbers.
Explore related subjects
Keep this discovery
Fahimeh Khosh-Ahang, Somayeh Moradi. 2016-01-07. Matchings in hypergraphs and Castelnuovo-Mumford regularity. https://arxiv.org/abs/1601.01456
Cite the original work for its findings. Save a collection to share your selection of sources.