The third author was partially supported by NSF grant DMS 1001781.
Tiling 3-Uniform Hypergraphs With K43−2e
Article first published online: 31 JAN 2013
© 2013 Wiley Periodicals, Inc.
Journal of Graph Theory
Volume 75, Issue 2, pages 124–136, February 2014
How to Cite
Czygrinow, A., DeBiasio, L. and Nagle, B. (2014), Tiling 3-Uniform Hypergraphs With K43−2e. J. Graph Theory, 75: 124–136. doi: 10.1002/jgt.21726
- Issue published online: 2 DEC 2013
- Article first published online: 31 JAN 2013
- Manuscript Revised: 10 DEC 2012
- Manuscript Received: 18 AUG 2011
- NSF. Grant Number: DMS 1001781
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 . Kühn and Osthus (J Combin Theory, Ser B 96(6) (2006), 767–821) proved that 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).