Embedding factorizations for 3-uniform hypergraphs

DOI10.1002/JGT.21669MaRDI QIDQ4920661zbMATH OpenOpenAlexWikidataFDO

Authors C. A. Rodger, M. A. Bahmanian

Publication date 21 May 2013

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1710.05949

zbMATH Keywords

amalgamationscomplete 3-uniform hypergraphsdecompositiondetachmentsembeddingfactorization

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Abstract: In this paper, 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>2m+(-1+sqrt8m^2-16m-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 towards settling an old question of Cameron on completing partial 1-factorizations of hypergraphs.

Recommendations

• Embedding factorizations for 3-uniform hypergraphs II: r-factorizations into s-factorizations
• Embedding connected factorizations
• Extending factorizations of complete uniform hypergraphs
• scientific article; zbMATH DE number 7283879
• Embedding edge‐colorings into 2‐edge‐connected k‐factorizations of k_kn+1

Cites work

• A Combinatorial Theorem with an Application to Latin Rectangles
• A partial Steiner triple system of order n can be embedded in a Steiner triple system of order 6n + 3
• A proof of Lindner's conjecture on embeddings of partial Steiner triple systems
• Amalgamations of almost regular edge-colourings of simple graphs
• Amalgamations of connected \(k\)-factorizations.
• Amalgamations of factorizations of complete graphs
• An existence theorem for latin squares
• Embedding edge‐colorings into 2‐edge‐connected k‐factorizations of k_kn+1
• Embeddings of Steiner triple systems
• Hamiltonian decompositions of complete graphs
• Hamiltonian decompositions of complete regular s-partite graphs
• scientific article; zbMATH DE number 3563169 (Why is no real title available?)

Cited in

(9)

• Factorizations of complete multipartite hypergraphs
• Extending factorizations of complete uniform hypergraphs
• Embedding factorizations for 3-uniform hypergraphs II: r-factorizations into s-factorizations
• Connected Baranyai's theorem
• Detachments of amalgamated 3-uniform hypergraphs: factorization consequences
• scientific article; zbMATH DE number 7283879 (Why is no real title available?)
• scientific article; zbMATH DE number 7774082 (Why is no real title available?)
• Toward a three-dimensional counterpart of Cruse's theorem
• On almost-regular edge colourings of hypergraphs

This page was built for publication: Embedding factorizations for 3-uniform hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4920661)