Tiling 3-Uniform Hypergraphs With K43?2e
Let denote the hypergraph consisting of two triples on four points. For an integer n, let denote the smallest integer d so that every 3-uniform hypergraph G of order n with minimum pair-degree contains vertex-disjoint copies of . Khn and Osthus (J Combin Theory, Ser B 96(6) (2006), 767821) proved that holds for large integers n. Here, we prove the exact counterpart, that for all sufficiently large integers n divisible by 4,
tiling hypergraphs factor absorbing