On colored designs — I
✍ Scribed by Y. Caro; Y. Roditty; J. Schönheim
- Book ID
- 108316049
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 722 KB
- Volume
- 164
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Complete results about the existence of colored designs were established by the authors for two and three colors for small graphs. Here general results are presented for any 2 colors and for particular classes of graphs such as P2,+ 1, 2tK2, tP3, K1,2, and tKx.,, when )~--2.
## Abstract Two resolutions __R__ and __R__^′^ of a combinatorial design are called orthogonal if |__R__~__i__~∩__R__|≤1 for all __R__~__i__~∈__R__ and __R__∈__R__^′^. A set __Q__={__R__^1^, __R__^2^, …, __R__^__d__^} of __d__ resolutions of a combinatorial design is called a set of mutually orthog