Tiling 3‐Uniform Hypergraphs With K 4 3 − 2 e

LetK 4 3 − 2 e denote the hypergraph consisting of two triples on four points. For an integer n , let t ( n , K 4 3 − 2 e ) denote the smallest integer d so that every 3‐uniform hypergraph G of order n with minimum pair‐degreeδ 2 ( G ) ≥ d contains ⌊ n / 4 ⌋ vertex‐disjoint copies ofK 4 3 − 2 e . Kühn and Osthus (J Combin Theory, Ser B 96(6) (2006), 767–821) proved that t ( n , K 4 3 − 2 e ) = n 4 ( 1 + o ( 1 ) )holds for large integers n . Here, we prove the exact counterpart, that for all sufficiently large integers n divisible by 4,A main ingredient in our proof is the recent “absorption technique” of Rödl, Ruciński, and Szemerédi (J. Combin. Theory Ser. A 116(3) (2009), 613–636).