Connected Baranyai's theorem

DOI10.1007/s00493-014-2928-3zbMath1324.05053arXiv1909.09643OpenAlexW2038230273MaRDI QIDQ397066

M. Amin Bahmanian

Publication date: 14 August 2014

Published in: Combinatorica (Search for Journal in Brave)

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

zbMATH Keywords

partitionconnected componentsfactorizationcomplete uniform 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) Connectivity (05C40) Combinatorial aspects of packing and covering (05B40) Graph designs and isomorphic decomposition (05C51)

Related Items

Embedding connected factorizations, Factorizations of complete multipartite hypergraphs, Explicit Baranyai partitions for quadruples, Part I: Quadrupling constructions

Cites Work

• Unnamed Item
• Unnamed Item
• Embedding an edge-colored \(K(a^{(p)};\lambda,\mu)\) into a Hamiltonian decomposition of \(K(a^{(p+r)};\lambda,\mu)\)
• 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
• Multiply balanced edge colorings of multigraphs
• Detachments of Hypergraphs I: The Berge–Johnson Problem
• Detachments of Amalgamated 3‐Uniform Hypergraphs Factorization Consequences
• Embedding Factorizations for 3-Uniform Hypergraphs