𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On balanced claw designs of complete multi-partite graphs

✍ Scribed by Kazuhiko Ushio

Publisher
Elsevier Science
Year
1982
Tongue
English
Weight
201 KB
Volume
38
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

In this paDer,

πŸ“œ SIMILAR VOLUMES

On the asymptotic value of the choice nu
On the asymptotic value of the choice number of complete multi-partite graphs
✍ Nurit Gazit; Michael Krivelevich πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 144 KB πŸ‘ 1 views

## Abstract We calculate the asymptotic value of the choice number of complete multi‐partite graphs, given certain limitations on the relation between the sizes of the different sides. In the bipartite case, we prove that if __n__~0~ ≀ __n__~1~ and log__n__~0~ ≫ loglog__n__~1~, then $ch(K\_{n\_{0},

On the decomposition of Kn into complete
On the decomposition of Kn into complete m-partite graphs
✍ Qingxue Huang πŸ“‚ Article πŸ“… 1991 πŸ› John Wiley and Sons 🌐 English βš– 195 KB πŸ‘ 1 views

## Abstract Graham and Pollak [3] proved that __n__ βˆ’1 is the minimum number of edge‐disjoint complete bipartite subgraphs into which the edges of __K__~__n__~ can be decomposed. Using a linear algebraic technique, Tverberg [2] gives a different proof of that result. We apply his technique to show