Decompositions of complete 3-uniform hypergraphs into small 3-uniform hypergraphs
نویسندگان
چکیده
In this paper we consider the problem of determining all values of v for which there exists a decomposition of the complete 3-uniform hypergraph on v vertices into edge-disjoint copies of a given 3-uniform hypergraph. We solve the problem for each 3-uniform hypergraph having at most three edges and at most six vertices, and for the 3-uniform hypergraph of order 6 whose edges form the lines of the Pasch configuration. D. BRYANT ET AL. /AUSTRALAS. J. COMBIN. 60 (2) (2014), 227–254 228
منابع مشابه
Decomposing complete 3-uniform hypergraphs into Hamiltonian cycles
Using the Katona-Kierstead definition of a Hamiltonian cycle in a uniform hypergraph, we continue the investigation of the existence of a decomposition of the complete 3-uniform hypergraph into Hamiltonian cycles began by Bailey and Stevens. We also discuss two extensions of the problem: to the complete 3-uniform hypergraph from which a parallel class of triples has been removed, and to the com...
متن کاملHamiltonian decompositions of complete k-uniform hypergraphs
Using a generalisation of Hamiltonian cycles to uniform hypergraphs due to Katona and Kierstead, we define a new notion of a Hamiltonian decomposition of a uniform hypergraph. We then consider the problem of constructing such decompositions for complete uniform hypergraphs, and describe its relationship with other topics, such as design theory.
متن کاملOn decompositions of complete hypergraphs
We study the minimum number of complete r-partite r-uniform hypergraphs needed to partition the edges of the complete r-uniform hypergraph on n vertices and we improve previous results of Alon.
متن کاملRecursive Formulae for the Chromatic Polynomials of Complete r-uniform Mixed Interval Hypergraphs
In response to a problem of Voloshin, we find recursive formulae for the chromatic polyno-mials of complete r-uniform interval hypergraphs and cohypergraphs. We also give recursive formulae for the chromatic polynomials of complete 3-uniform and 4-uniform interval bihy-pergraphs and comment on the challenges for general r. Our method is to exploit the uniform and complete structure of these hyp...
متن کاملEMBEDDINGS AND RAMSEY NUMBERS OF SPARSE k-UNIFORM HYPERGRAPHS
Chvátal, Rödl, Szemerédi and Trotter [3] proved that the Ramsey numbers of graphs of bounded maximum degree are linear in their order. In [6, 23] the same result was proved for 3-uniform hypergraphs. Here we extend this result to k-uniform hypergraphs for any integer k ≥ 3. As in the 3-uniform case, the main new tool which we prove and use is an embedding lemma for k-uniform hypergraphs of boun...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Australasian J. Combinatorics
دوره 60 شماره
صفحات -
تاریخ انتشار 2014