• amalgamations;
  • detachments;
  • complete 3-uniform hypergraphs;
  • embedding;
  • factorization;
  • decomposition


In this article, two results are obtained on a hypergraph embedding problem. The proof technique is itself of interest, being the first time amalgamations have been used to address the embedding of hypergraphs. The first result finds necessary and sufficient conditions for the embedding a hyperedge-colored copy of the complete 3-uniform hypergraph of order m, inline image, into an r-factorization of inline image, providing that inline image. The second result finds necessary and sufficient conditions for an embedding when not only are the colors of the hyperedges of inline image given, but also the colors of all the “pieces” of hyperedges on these m vertices are prescribed (the “pieces” of hyperedges are eventually extended to hyperedges of size 3 in inline image by adding new vertices to the hyperedges of size 1 and 2 during the embedding process). Both these results make progress toward settling an old question of Cameron on completing partial 1-factorizations of hypergraphs. © 2012 Wiley Periodicals, Inc. J. Graph Theory 73: 216–224, 2013