𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Decomposition of the complete hypergraph into delta-systems I

✍ Scribed by A.F Mouyart; F Sterboul

Publisher
Elsevier Science
Year
1985
Tongue
English
Weight
723 KB
Volume
40
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Decomposition of complete graphs into 5-
Decomposition of complete graphs into 5-cubes
✍ D. Bryant; S. I. El-Zanati; B. Maenhaut; C. Vanden Eynden πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 116 KB

## Abstract Necessary conditions for the complete graph on __n__ vertices to have a decomposition into 5‐cubes are that 5 divides __n__β€‰βˆ’β€‰1 and 80 divides __n__(__n__β€‰βˆ’β€‰1)/2. These are known to be sufficient when __n__ is odd. We prove them also sufficient for __n__ even, thus completing the spectr

On the decomposition of kn into complete
On the decomposition of kn into complete bipartite graphs
✍ H. Tverberg πŸ“‚ Article πŸ“… 1982 πŸ› John Wiley and Sons 🌐 English βš– 76 KB πŸ‘ 1 views

## Abstract A short proof is given of the impossibility of decomposing the complete graph on __n__ vertices into __n__‐2 or fewer complete bipartite graphs.

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