Abstract
Let k and n be two integers, with k≥3, n≡0(modk), and n sufficiently large. We determine the (k−1)-degree threshold for the existence of a rainbow perfect matchings in n-vertex k-uniform hypergraph. This implies the result of Rödl, Ruciński, and Szemerédi on the (k−1)-degree threshold for the existence of perfect matchings in n-vertex k-uniform hypergraphs. In our proof, we identify the extremal configurations of closeness, and consider whether or not the hypergraph is close to the extremal configuration. In addition, we also develop a novel absorbing device and generalize the absorbing lemma of Rödl, Ruciński, and Szemerédi.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.