Abstract
A matching of a [Formula: see text]-uniform hypergraph is a set of pairwise disjoint edges. A [Formula: see text]-matching in a [Formula: see text]-uniform hypergraph [Formula: see text] is a matching of size [Formula: see text]. Let [Formula: see text] be a [Formula: see text]-uniform hypergraph of order [Formula: see text] and [Formula: see text]. If [Formula: see text] for any two adjacent vertices [Formula: see text], and [Formula: see text], then [Formula: see text] contains a [Formula: see text]-matching. This result is an extension of a work of Bollobás, Daykin and Erdős [Sets of independent edges of a hypergraph, Quart. J. Math. Oxford 21 (1976) 25–32].
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
