Constructions and uses of incomplete pairwise balanced designs (Q2334435): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2952812799 / rank | |||
Normal rank | |||
Revision as of 00:18, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
