One-factors and the existence of affine designs, Discrete Mathematics 120 (1993) 25-35. Kiihler (1982) defines a graph G, for p a prime which he relates to affine designs. He shows that if the graph has a l-factor then there exists an affine 3-(p, 4, %) design with 1, satisfying the usual necessary
On the existence of one-sided designs
โ Scribed by J. K. Doyle; C. J. Leska
- Publisher
- Springer
- Year
- 1980
- Tongue
- English
- Weight
- 240 KB
- Volume
- 9
- Category
- Article
- ISSN
- 0046-5755
No coin nor oath required. For personal study only.
โฆ Synopsis
A collection of subsets (called blocks) of a fixed vertex set (possibly with repetition) is called a (t,, tn-1 ..... tl ; am, am-1 ..... al)-design if it satisfies certain regularity conditions on the number of blocks which contain subsets of the vertex set of certain size, and other regularity conditions on the size of the intersections of certain numbers of the blocks. (For example, a BIBD (or (b, v, r, k, A)-configuration) is a (1, 2; 1
๐ SIMILAR VOLUMES
We examine predictions and judgments of confidence based on one-sided evidence. Some subjects saw arguments for only one side of a legal dispute while other subjects (called 'jurors') saw arguments for both sides. Subjects predicted the number of jurors who favored the plaintiff in each case. Subjec