Packing k-partite k-uniform hypergraphs
arXiv:1402.5643
Abstract
Let and be -graphs (-uniform hypergraphs); then a perfect -packing in is a collection of vertex-disjoint copies of in which together cover every vertex of . For any fixed let be the minimum such that any -graph on vertices with minimum codegree contains a perfect -packing. The problem of determining has been widely studied for graphs (i.e. -graphs), but little is known for . Here we determine the asymptotic value of for all complete -partite -graphs , as well as a wide class of other -partite -graphs. In particular, these results provide an asymptotic solution to a question of Rödl and Ruciński on the value of when is a loose cycle. We also determine asymptotically the codegree threshold needed to guarantee an -packing covering all but a constant number of vertices of for any complete -partite -graph .
arXiv commentv2: Updated with minor corrections. Accepted for publication in Journal of Combinatorial Theory, Series A
References in corpus (9)
- Loose Hamilton cycles in hypergraphs
- Hypergraph regularity and the multidimensional Szemerédi theorem
- Perfect matchings in r-partite r-graphs
- Polynomial-time perfect matchings in dense hypergraphs
- Perfect Matchings in 4-uniform hypergraphs
- Perfect matching in 3-uniform hypergraphs with large vertex degree
- -factors in hypergraphs via absorption
- Perfect Packings in Quasirandom Hypergraphs II
- Minimum vertex degree threshold for -tiling