Detachments of Amalgamated 3‐Uniform Hypergraphs Factorization Consequences

DOI10.1002/jcd.21310zbMath1258.05087arXiv1710.03847MaRDI QIDQ4906045

M. Amin Bahmanian

Publication date: 21 February 2013

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

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

zbMATH Keywords

decomposition; factorization; amalgamations; detachments; 3-uniform hypergraphs; laminar families

Mathematics Subject Classification ID

05C65: Hypergraphs

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

Related Items

Connected Baranyai's theorem, On almost-regular edge colourings of hypergraphs, Embedding connected factorizations, Factorizations of complete multipartite hypergraphs

Cites Work

• Unnamed Item
• 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
• Generalized latin rectangles I: Construction and decomposition
• Generalized latin rectangles. II: Embedding
• On decomposition of r-partite graphs into edge-disjoint Hamilton circuits
• The edge-coloring of complete hypergraphs. I
• Amalgamations of connected \(k\)-factorizations.
• Hamilton decompositions of complete graphs with a 3-factor leave.
• Nondisconnecting disentanglements of amalgamated 2-factorizations of complete multipartite graphs
• Connected Detachments of Graphs and Generalized Euler Trails
• On A Particular Conference Scheduling Problem
• Embedding edge‐colorings into 2‐edge‐connected k‐factorizations of k_kn+1
• Hamilton decompositions of complete multipartite graphs with any 2‐factor leave
• Highly edge-connected detachments of graphs and digraphs