Constructions and uses of incomplete pairwise balanced designs

DOI10.1007/S10623-019-00645-6MaRDI QIDQ2334435zbMATH OpenOpenAlexFDO

Authors Peter Dukes, Esther R. Lamken

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

zbMATH Keywords

block designgroup divisible designincomplete designorthogonalLatin squarepairwise balanced designresolvable designsubdesign

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Orthogonal arrays, Latin squares, Room squares (05B15) Other designs, configurations (05B30) Graph designs and isomorphic decomposition (05C51) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Abstract: We give explicit constructions for incomplete pairwise balanced designs IPBD$((v;w),K)$, or, equivalently, edge-decompositions of a difference of two cliques $K_{v}setminus{K}_w$ into cliques whose sizes belong to the set $K$. Our constructions produce such designs whenever $v$ and $w$ satisfy the usual divisibility conditions, have ratio $v/w$ bounded away from the smallest value in $K$ minus one, say $v/w>k-1+epsilon$, for $k=minK$ and $epsilon>0$, and are sufficiently large (depending on $K$ and $epsilon$). As a consequence, some new results are obtained on many related designs, including class-uniformly resolvable designs, incomplete mutually orthogonal latin squares, and group divisible designs. We also include several other applications that illustrate the power of using IPBDs as `templates'.

Review text

In terms of graph theory, the paper contains a sufficient condition for a decomposition of the edge set of the complete graph \(K_{n}\) with a hole \( K_{t}\) (with edges of a clique \(K_{t}\) removed from \(K_{n}\)) into cliques whose sizes belongs to a given set \(K.\) Then this strong theorem is used to obtain various new results.

Recommendations

• An existence theory for incomplete designs
• scientific article; zbMATH DE number 553914
• Pairwise balanced designs covered by bounded flats
• Percentages in pairwise balanced designs
• Four pairwise balanced designs

Cites work

• A new class of group divisible designs with block size three
• A survey of Kirkman triple systems and related designs
• An existence theory for incomplete designs
• 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 pairwise balanced designs. III: Proof of the existence conjectures
• Asymptotic Existence of Resolvable Graph Designs
• Asymptotic existence theorems for frames and group divisible designs
• Asymptotic results on the existence of 4‐RGDDs and uniform 5‐GDDs
• Class-uniformly resolvable pairwise balanced designs with block size two and three
• Counting designs
• Covering and packing for pairs
• Decompositions of edge-colored complete graphs
• Designs with mutually orthogonal resolutions and decompositions of edge‐colored graphs
• Edge-decompositions of graphs with high minimum degree
• Eine Bemerkung zur Abschätzung der Anzahl orthogonaler lateinischer Quadrate mittels Siebverfahren
• Equitable embeddings of Steiner triple systems
• Group divisible designs with block size four and group type g^um^1
• Group divisible designs with block size four and group type \(g^{u} m^{1}\) for small \(g\)
• Group-divisible designs with block size four and group-type \(g^um^1\) with \(m\) as large or as small as possible
• scientific article; zbMATH DE number 426163 (Why is no real title available?)
• scientific article; zbMATH DE number 4110702 (Why is no real title available?)
• scientific article; zbMATH DE number 3487460 (Why is no real title available?)
• scientific article; zbMATH DE number 3503285 (Why is no real title available?)
• scientific article; zbMATH DE number 1314686 (Why is no real title available?)
• scientific article; zbMATH DE number 1011073 (Why is no real title available?)
• scientific article; zbMATH DE number 3430675 (Why is no real title available?)
• scientific article; zbMATH DE number 3346374 (Why is no real title available?)
• Mutually orthogonal Latin squares with large holes
• On combinatorial designs with subdesigns
• On complementary decompositions of the complete graph
• On the Maximal Number of Pairwise Orthogonal Latin Squares of a Given Order
• Optimal packings of \(K_4\)'s into a \(K_n\)
• The asymptotic existence of resolvable group divisible designs
• The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹

Cited in

(7)

• Constructions of partially balanced crossover designs based on two and higher order association schemes
• An existence theory for incomplete designs
• scientific article; zbMATH DE number 2128114 (Why is no real title available?)
• scientific article; zbMATH DE number 3875293 (Why is no real title available?)
• scientific article; zbMATH DE number 4214006 (Why is no real title available?)
• scientific article; zbMATH DE number 553914 (Why is no real title available?)
• scientific article; zbMATH DE number 1792569 (Why is no real title available?)

This page was built for publication: Constructions and uses of incomplete pairwise balanced designs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2334435)