Explicit Baranyai partitions for quadruples, Part I: Quadrupling constructions

DOI10.1002/jcd.21776arXiv2007.11626OpenAlexW3153814879MaRDI QIDQ6145733

Alexander Vardy, Tuvi Etzion, Yeow Meng Chee, Cheng Min Wang, Han Mao Kiah

Publication date: 2 February 2024

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

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

zbMATH Keywords

Baranyai's theoremone-factorizationBaranyai partitionsnear-one-factorization

Mathematics Subject Classification ID

Partitions of sets (05A18) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Connected Baranyai's theorem
• On almost-regular edge colourings of hypergraphs
• On large sets of disjoint Steiner triple systems. IV
• On large sets of disjoint Steiner triple systems. I
• The existence of resolvable Steiner quadruple systems
• A completion of Lu's determination of the spectrum for large sets of disjoint Steiner triple systems
• A new existence proof for large sets of disjoint Steiner triple systems
• Detachments of Hypergraphs I: The Berge–Johnson Problem
• Maximal Flow Through a Network
• On Quadruple Systems
• Towards a Large Set of Steiner Quadruple Systems
• Resolvable Steiner Quadruple Systems for the Last 23 Orders
• Max flows in O(nm) time, or better
• Enumerative source encoding

This page was built for publication: Explicit Baranyai partitions for quadruples, Part I: Quadrupling constructions