Abstract
AbstractFor a ‐uniform hypergraph , let denote the minimum vertex degree of , and denote the size of the largest matching in . In this paper, we show that for any and , there exists an integer such that for positive integers and , if is an ‐vertex ‐graph with , then . This improves upon earlier results of Bollobás, Daykin, and Erdős for the range and Huang and Zhao for the range .
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
