Detachments of Hypergraphs I: The Berge–Johnson Problem

DOI10.1017/S0963548312000041zbMath1247.05161arXiv1710.05804OpenAlexW2073365392MaRDI QIDQ2908122

M. Amin Bahmanian

Publication date: 4 September 2012

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

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

zbMATH Keywords

vertex splittingdetachment of a hypergraph

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Combinatorial aspects of packing and covering (05B40) Graph designs and isomorphic decomposition (05C51)

Related Items (10)

Embedding connected factorizations ⋮ Embedding factorizations for 3-uniform hypergraphs II: \(r\)-factorizations into \(s\)-factorizations ⋮ Factorizations of complete multipartite hypergraphs ⋮ Ryser's theorem for \(\rho\)-Latin rectangles ⋮ Connected Baranyai's theorem ⋮ Symmetric Layer-Rainbow Colorations of Cubes ⋮ Explicit Baranyai partitions for quadruples, Part I: Quadrupling constructions ⋮ On regular set systems containing regular subsystems ⋮ On almost-regular edge colourings of hypergraphs ⋮ Disjoint Spread Systems and Fault Location

Cites Work

• 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
• On the edge-colouring problem for unions of complete uniform hypergraphs
• The edge-coloring of complete hypergraphs. I
• Amalgamations of connected \(k\)-factorizations.
• Hamilton decompositions of complete graphs with a 3-factor leave.
• Outline and Amalgamated Triple Systems of Even Index
• Nondisconnecting disentanglements of amalgamated 2-factorizations of complete multipartite graphs
• The reconstruction of latin squares with applications to school timetabling and to experimental design
• Embedding edge‐colorings into 2‐edge‐connected k‐factorizations of k_kn+1
• Hamilton decompositions of complete multipartite graphs with any 2‐factor leave

This page was built for publication: Detachments of Hypergraphs I: The Berge–Johnson Problem