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 hypergraphs
✍ Scribed by Zbigniew Lonc; Miroslaw Truszczyński
- Publisher
- Springer Netherlands
- Year
- 1985
- Tongue
- English
- Weight
- 294 KB
- Volume
- 1
- Category
- Article
- ISSN
- 0167-8094
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
A conjecture of Bollobás and Thomason asserts that, for r ≥ 1, every r -uniform hypergraph with m edges can be partitioned into r classes such that every class meets at least rm/(2r -1) edges. Bollobás, Reed and Thomason [3] proved that there is a partition in which every edge meets at least (1 -1/e
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}
If H is an r-uniform hypergraph of order p without (r + 1)-cliques, then the transversal number of H has an upper bound in terms of the parameter c = p -2r. As corollaries of the main theorem, lower bounds for the largest order of r-uniform hypergraphs with specified transversal number and for the s