English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

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 ,    K  m  3   , into an  r ‐factorization of    K  n  3   , providing that    n  >  2  m  +  (  −  1  +    8   m  2   −  16  m  −  7    )  /  2   . The second result finds necessary and sufficient conditions for an embedding when not only are the colors of the hyperedges of    K  m  3    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    K  n  3    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

Embedding Factorizations for 3‐Uniform Hypergraphs