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}
✦ LIBER ✦
Minimal decompositions of hypergraphs into mutually isomorphic subhypergraphs
✍ Scribed by F.R.K Chung; P Erdös; R.L Graham
- Publisher
- Elsevier Science
- Year
- 1982
- Tongue
- English
- Weight
- 428 KB
- Volume
- 32
- Category
- Article
- ISSN
- 0097-3165
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Decompositions of hypergraphs into hyper
✍
Zbigniew Lonc
📂
Article
📅
1987
🏛
Elsevier Science
🌐
English
⚖ 630 KB
Decompositions of complete graphs into i
✍
Anton Kotzig
📂
Article
📅
1981
🏛
Elsevier Science
🌐
English
⚖ 218 KB
Decompositions of complete graphs into i
✍
R. Balakrishnan; R. Sampath Kumar
📂
Article
📅
1994
🏛
Springer Japan
🌐
English
⚖ 241 KB
Edge-decompositions of Kn,n into isomorp
✍
Anna Lladó; S.C. López
📂
Article
📅
2004
🏛
John Wiley and Sons
🌐
English
⚖ 167 KB
We study the Ha ¨ggkvist conjecture which states that, for each tree T with n edges, there is an edge-partition of the complete bipartite graph K n;n into n isomorphic copies of T . We use the concept of bigraceful labelings, introduced in [7], which give rise to cyclic decompositions of K n;n . Whe
Decomposition of the complete hypergraph
✍
A.F Mouyart; F Sterboul
📂
Article
📅
1985
🏛
Elsevier Science
🌐
English
⚖ 723 KB
Decomposition of the complete hypergraph
✍
A.F Mouyart; F Sterboul
📂
Article
📅
1986
🏛
Elsevier Science
🌐
English
⚖ 402 KB