Constructions and uses of incomplete pairwise balanced designs (Q2334435)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Constructions and uses of incomplete pairwise balanced designs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Constructions and uses of incomplete pairwise balanced designs |
scientific article |
Statements
Constructions and uses of incomplete pairwise balanced designs (English)
0 references
7 November 2019
0 references
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.
0 references
block design
0 references
group divisible design
0 references
pairwise balanced design
0 references
resolvable design
0 references
orthogonalLatin square
0 references
incomplete design
0 references
subdesign
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8448686599731445
0 references
0.8425341844558716
0 references
0.7776337265968323
0 references
0.7756906151771545
0 references
