Egalitarian Steiner quadruple systems of doubly even order
From MaRDI portal
Publication:2138984
DOI10.1016/J.DISC.2022.112887zbMATH Open1489.05012OpenAlexW4220817676MaRDI QIDQ2138984FDOQ2138984
Authors: Charles J. Colbourn
Publication date: 17 May 2022
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2022.112887
Recommendations
Combinatorial aspects of block designs (05B05) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cites Work
- On Quadruple Systems
- Title not available (Why is that?)
- Existence of Steiner quadruple systems with a spanning block design
- On the 3BD-closed set \(B_3(\{4,5\})\)
- Title not available (Why is that?)
- Steiner quadruple systems - a survey
- Supermagic Complete Graphs
- The existence of resolvable Steiner quadruple systems
- The last twenty orders of (1,2)-resolvable Steiner quadruple systems
- Resolvable Steiner Quadruple Systems for the Last 23 Orders
- Title not available (Why is that?)
- Title not available (Why is that?)
- Doubly resolvable Steiner quadruple systems and related designs
- Cyclic Steiner quadruple systems and Köhler's orbit graphs
- Affine-invariant strictly cyclic Steiner quadruple systems
- Product constructions for cyclic block designs. I: Steiner quadruple systems
- Title not available (Why is that?)
- Sur les systèmes de quadruples
- On the existence of \(S(3,\{4,5,7\},v)\)
- Egalitarian edge orderings of complete graphs
- Access balancing in storage systems by labeling partial Steiner systems
- MaxMinSum Steiner systems for access balancing in distributed storage
- Egalitarian Steiner triple systems for data popularity
- A new infinite class of S(3, {4, 5, 7}, v)
- Optimal Fraction Repetition Codes for Access-Balancing in Distributed Storage
Cited In (3)
This page was built for publication: Egalitarian Steiner quadruple systems of doubly even order
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2138984)