๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

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


Decompositions of Edge-Colored Complete
โœ Esther R. Lamken; Richard M. Wilson ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 538 KB

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

Designs with mutually orthogonal resolut
โœ E. R. Lamken ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 298 KB

## 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

d-Cube decompositions ofKn/Km
โœ Peter Adams; Darryn E. Bryant; Saad I. El-Zanati; Charles Vanden Eynden ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Springer Japan ๐ŸŒ English โš– 288 KB
Decompositions of Leaf-Colored Binary Tr
โœ M. Steel ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 786 KB

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.

Edge-colored saturated graphs
โœ D. Hanson; B. Toft ๐Ÿ“‚ Article ๐Ÿ“… 1987 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 266 KB