Abstract
We determine a minimum cardinality family ℱ n, k (resp. ℋ n, k ) ofn-uniform,k-edge hypergraphs satisfying the following property: all, except for finitely many,n-uniform hypergraphs satisfying the divisibility condition have an ℱ n, k -decomposition (resp. vertex ℋ n, k -decomposition).
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Z. Baranyai (1975) On the factorization of the complete uniform hypergraphs, inInfinite and Einite Sets, Coll. Math. Soc. J. Bolyai,10 (eds. A. Hajnal, R. Rado and V. T. Sós), North Holland, Amsterdam.
C. Berge (1979)Graphs and Hypergraphs, North Holland, Amsterdam.
J. C. Bermond and D. Sotteau (1975) Graph decompositions and G-designs, Proc. Fifth British Combinatorial Conf., Aberdeen, 1975,Utilitas Math. Congressus No. XV, pp. 53–72.
J. C. Bermond (1978) Hamiltonian decompositions of graphs, directed graphs and hypergraphs,Ann. Discrete Math. 3, 21–28.
F. R. K. Chung and R. L. Graham (1981) Recent results in graph decompositions, inCombinatorics (ed. H. N. V. Temperley), London Math. Soc. Lecture Notes, Ser. 52, Cambridge Univ. Press, pp. 103–123.
P. Erdös and R. Rado (1960) Intersection theorems for systems of sets,J. London Math. Soc. 35, 85–90.
R. L. Graham, B. L. Rothschild, and J. H. Spencer (1980)Ramsey Theory, Wiley, New York.
Z. Lonc (1983) Decompositions of hypergraphs into hyperstars, manuscript.
S. Yamamoto and S. Tazawa (1980) Hyperclaw decomposition of complete hypergraphs,Ann. Discrete Math. 6, 385–391.
Author information
Authors and Affiliations
Additional information
Communicated by W. T. Trotter
Rights and permissions
About this article
Cite this article
Lonc, Z., Truszczyński, M. Decomposition of large uniform hypergraphs. Order 1, 345–350 (1985). https://doi.org/10.1007/BF00582740
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF00582740