✦ LIBER ✦

Decomposition of the complete hypergraph into delta-systems II

✍ Scribed by A.F Mouyart; F Sterboul

Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 402 KB
Volume: 41
Category: Article
ISSN: 0097-3165
DOI: 10.1016/0097-3165(86)90120-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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

On the decomposition of a complete graph

On the decomposition of a complete graph into planar subgraphs

✍ Isao Shirakawa; Hiromitsu Takahashi; Hiroshi Ozaki 📂 Article 📅 1967 🏛 Elsevier Science 🌐 English ⚖ 692 KB

Decomposition of the complete graph plus

Decomposition of the complete graph plus a 1-factor into cycles of equal length

✍ Mateja Šajna 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 354 KB 👁 1 views

## Abstract We determine the necessary and sufficient conditions for the existence of a decomposition of the complete graph of even order with a 1‐factor added into cycles of equal length. © 2003 Wiley Periodicals, Inc. J Combin Designs 11: 170–207, 2003; Published online in Wiley InterScience (www

The decompositions of line graphs, middl

The decompositions of line graphs, middle graphs and total graphs of complete graphs into forests

✍ Jin Akiyama; Takashi Hamada 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 461 KB

We construct decompositions of L(K,,), M(K,,) and T(K,,) into the minimum number of line-disjoint spanning forests by applying the usual criterion for a graph to be eulerian. This gives a realization of the arboricity of each of these three graphs. ## 1. Preliminaries In this paper a graph is cons