𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Decompositions of hypergraphs into hyperstars

✍ Scribed by Zbigniew Lonc


Publisher
Elsevier Science
Year
1987
Tongue
English
Weight
630 KB
Volume
66
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis


In the paper we investigate decompositions of hypergraphs into hyperstars. A hyperstar with center F and size c is every hypergraph (X, ~) such that F c_ n ~ and I~1 = c. A decomposition of a hypergraph (X, ~) into hypergraphs from a certain class YC is a family of hypergraphs {Hi = (X, ~i): i β€’ I} such that {~i: i β€’ I} is a partition of ~ and each Hi is isomorphic to a hypergraph in X.

In the paper we find necessary and sutiieient conditions for existence of a decomposition of a hypergraph into hyperstars with given centers and sizes. This result is then applied to obtain suttieient conditions for existence of a hyperstar decomposition of the hypergraphs Pm= (X, ~(X){~}) and K~,=(X, ~n(X)), IXl=m. As a corollary, these results give a partial solution of a problem of Yamamoto and Tazawa [7] related to hyperstar decompositions of K~,.


πŸ“œ SIMILAR VOLUMES


Hamilton decompositions of complete 3-un
✍ Helen Verrall πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 947 KB

The problem of finding a Hamilton decomposition of the complete 3-uniform hypergraph K,3 has been solved for n = 2 (mod 3) and n = 4(mod 6) . We find here a Hamilton decomposition of Ki, no l(mod 6), and a Hamilton decomposition of the complete 3-uniform hypergraph minus a l-factor, Ki -I, n = 0 (mo

Decomposition of large uniform hypergrap
✍ Zbigniew Lonc; Miroslaw TruszczyΕ„ski πŸ“‚ Article πŸ“… 1985 πŸ› Springer Netherlands 🌐 English βš– 294 KB
Decompositions of graphs into trees
✍ Zbigniew Lonc πŸ“‚ Article πŸ“… 1989 πŸ› John Wiley and Sons 🌐 English βš– 460 KB