𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Edge-Colorings of Complete Graphs that Avoid Polychromatic Trees

✍ Scribed by Tao Jiang; Douglas B. West

Book ID
108497954
Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
485 KB
Volume
11
Category
Article
ISSN
1571-0653

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Edge colorings of complete graphs withou
Edge colorings of complete graphs without tricolored triangles
✍ AndrΓ‘s GyΓ‘rfΓ‘s; GΓ‘bor Simony πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 59 KB

## Abstract We show some consequences of results of Gallai concerning edge colorings of complete graphs that contain no tricolored triangles. We prove two conjectures of Bialostocki and Voxman about the existence of special monochromatic spanning trees in such colorings. We also determine the size

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

Almost regular edge colorings and regula
Almost regular edge colorings and regular decompositions of complete graphs
✍ Darryn Bryant; Barbara Maenhaut πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 127 KB

## Abstract For __k__ = 1 and __k__ = 2, we prove that the obvious necessary numerical conditions for packing __t__ pairwise edge‐disjoint __k__‐regular subgraphs of specified orders __m__~1~,__m__~2~,… ,__m__~t~ in the complete graph of order __n__ are also sufficient. To do so, we present an edge