Perfect Matchings in Large Uniform Hypergraphs with Large Minimu...

Journal of Combinatorial Theory, Series A 116 (2009) 613–636Contents lists available at ScienceDirectJournal of Combinatorial Theory, Series Awww.elsevier.com/locate/jctaPerfect matchings in large uniform hypergraphs with large minimum collective degreeVojtech Rödl a,1, Andrzej Ruciński b,2, Endre Szemerédi c,3a Emory University, Atlanta, GA, USA b A. Mickiewicz University, Poznań, Poland c Rutgers University, New Brunswick, NJ, USAa r t i c l e i n f o a b s t r a c tArticle history: Received