𝔖 Bobbio Scriptorium
✦   LIBER   ✦

2-Colored triangles in edge-colored complete graphs, II

✍ Scribed by D.T Busolini

Book ID
107884135
Publisher
Elsevier Science
Year
1981
Tongue
English
Weight
201 KB
Volume
30
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Properly colored hamilton cycles in edge
Properly colored hamilton cycles in edge-colored complete graphs
✍ N. Alon; G. Gutin πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 156 KB πŸ‘ 3 views

It is shown that, for β‘€ ) 0 and n ) n β‘€ , any complete graph K on n vertices 0 ' Ε½ . whose edges are colored so that no vertex is incident with more than 1 y 1r 2 y β‘€ n edges of the same color contains a Hamilton cycle in which adjacent edges have distinct colors. Moreover, for every k between 3 and

Decompositions of Edge-Colored Complete
Decompositions of Edge-Colored Complete Graphs
✍ 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