✦ LIBER ✦

The edge-coloring of complete hypergraphs I

✍ Scribed by Zsolt Baranyai

Publisher: Elsevier Science
Year: 1979
Tongue: English
Weight: 970 KB
Volume: 26
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(79)90002-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the use of alternating chains and hyp

On the use of alternating chains and hypergraphs in edge coloring

✍ D. de Werra 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 320 KB

## Abstract Existence of some generalized edge colorings is proved by using the properties of hypergraphs as well as alternating chain methods. A general framework is given for edge colorings and some general properties of balancing are derived.

Extremal problems concerning transformat

Extremal problems concerning transformations of the edges of the complete hypergraphs

✍ Yair Caro 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 456 KB

We consider extremal problems concerning transformations of the edges of complete hypergraphs. We estimate the order of the largest subhypergraph K such that for every edge e E €(K), f(e) e f ( K ) , assuming f(e) # e. Several extensions and variations of this problem are also discussed here.

Coloring the Edges of a Complete Graph

✍ Annamaria G. Varga 📂 Article 📅 1972 🏛 John Wiley and Sons 🌐 English ⚖ 577 KB

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

Decomposition of the complete hypergraph

Decomposition of the complete hypergraph into delta-systems I

✍ A.F Mouyart; F Sterboul 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 723 KB

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