We prove an asymptotic existence theorem for decompositions of edge-colored complete graphs into prespecified edge-colored subgraphs. Many combinatorial design problems fall within this framework. Applications of our main theorem require calculations involving the numbers of edges of each color and
Edge-colored cube decompositions
โ Scribed by Peter Adams; Darryn E. Bryant; Heather Jordon
- Book ID
- 105752048
- Publisher
- Springer
- Year
- 2006
- Tongue
- English
- Weight
- 184 KB
- Volume
- 72
- Category
- Article
- ISSN
- 0001-9054
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
## 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
Leaf-colored binary trees, with an induced integer "length," arise in biomathematics. We analyse such trees in terms of a natural bipartition of their edge set, and, extending a recent decomposition for binary trees, obtain enumerative formulae. 1993 Academic Press. Inc.