Embedding Factorizations for 3-Uniform Hypergraphs

DOI10.1002/jgt.21669zbMath1264.05088arXiv1710.05949OpenAlexW1532260067WikidataQ114236179 ScholiaQ114236179MaRDI QIDQ4920661

C. A. Rodger, M. Amin 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

decompositionembeddingfactorizationamalgamationsdetachmentscomplete 3-uniform hypergraphs

Mathematics Subject Classification ID

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

Related Items

Embedding factorizations for 3-uniform hypergraphs II: \(r\)-factorizations into \(s\)-factorizations ⋮ Factorizations of complete multipartite hypergraphs ⋮ Connected Baranyai's theorem ⋮ On almost-regular edge colourings of hypergraphs

Cites Work

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