Constructions and uses of incomplete pairwise balanced designs
DOI10.1007/s10623-019-00645-6zbMath1429.05021arXiv1809.07866OpenAlexW2952812799MaRDI QIDQ2334435
Esther R. Lamken, Peter J. Dukes
Publication date: 7 November 2019
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1809.07866
group divisible designpairwise balanced designblock designresolvable designsubdesignincomplete designorthogonalLatin square
Combinatorial aspects of block designs (05B05) Other designs, configurations (05B30) Orthogonal arrays, Latin squares, Room squares (05B15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph designs and isomorphic decomposition (05C51)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Group divisible designs with block size four and group type \(g^um^1\)
- Asymptotic existence theorems for frames and group divisible designs
- On combinatorial designs with subdesigns
- On complementary decompositions of the complete graph
- Class-uniformly resolvable pairwise balanced designs with block size two and three
- A survey of Kirkman triple systems and related designs
- A new class of group divisible designs with block size three
- An existence theory for pairwise balanced designs. III: Proof of the existence conjectures
- Optimal packings of \(K_4\)'s into a \(K_n\)
- Group-divisible designs with block size four and group-type \(g^um^1\) with \(m\) as large or as small as possible
- Counting designs
- Eine Bemerkung zur Abschätzung der Anzahl orthogonaler lateinischer Quadrate mittels Siebverfahren
- Group divisible designs with block size four and group type \(g^{u} m^{1}\) for small \(g\)
- Equitable embeddings of Steiner triple systems
- Decompositions of edge-colored complete graphs
- Mutually orthogonal Latin squares with large holes
- Covering and packing for pairs
- An existence theory for pairwise balanced designs. I: Composition theorems and morphisms
- An existence theory for pairwise balanced designs. II: Structure of PBD- closed sets and the existence conjectures
- An Existence Theory for Incomplete Designs
- On the Maximal Number of Pairwise Orthogonal Latin Squares of a Given Order
- Asymptotic Existence of Resolvable Graph Designs
- Designs with mutually orthogonal resolutions and decompositions of edge‐colored graphs
- Asymptotic results on the existence of 4‐RGDDs and uniform 5‐GDDs
- The Asymptotic Existence of Resolvable Group Divisible Designs
- The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹
- Edge-decompositions of graphs with high minimum degree
This page was built for publication: Constructions and uses of incomplete pairwise balanced designs
