Abstract
Anh-uniform hypergraph generated by a set of edges {E 1,...,E c} is said to be a delta-system Δ(p,h,c) if there is ap-element setF such that ∇F|=p andE i⌢E j=F,∀i≠j.
The main result of this paper says that givenp, h andc, there isn 0 such that forn≥n 0 the set of edges of a completeh-uniform hypergraphK n h can be partitioned into subsets generating isomorphic delta-systems Δ(p, h, c) if and only if\(\left( {\begin{array}{*{20}c} n \\ h \\ \end{array} } \right) \equiv 0(\bmod c)\). This result is derived from a more general theorem in which the maximum number of delta-systems Δ(p, h, c) that can be packed intoK n h and the minimum number of delta-systems Δ(p, h, c) that can cover the edges ofK n h are determined for largen. Moreover, we prove a theorem on partitioning of the edge set ofK n h into subsets generating small but not necessarily isomorphic delta-systems.
Similar content being viewed by others
References
Baranyai, Z.: On the Factorization of the Complete Uniform Hypergraph. In: Colloquia Math. Soc. J. Bolyai 10, Finite and Infinite Sets, pp. 91–108. Amsterdam: North Holland 1975
Chung, F.R.K., Graham, R.L.: Recent Results in Graph Decompositions. In Combinatorics (H.N.V. Temperley, ed.), London Math. Soc., Lecture Notes Series52, 103–124 (1981)
Folkman, J. Fulkerson, D.R.: Edge Colorings in Bipartite Graphs. Combinatorial Mathematics and Their Applications. Chapel Hill: University of North Carolina Press 1969
Hajnal, A., Szemeredi, E.: Proof of a Conjecture of Erdös. In: Combinatorial Theory and Its Applications II (Proc. Colloq. Balonfured, 1969), 601–623
Lonc, Z.: Decompositions of Hypergraphs into Hyperstars. Discrete Math.66, 157–168 (1987)
Lonc, Z.: Solution of a Delta-System Decomposition Problem. Journal of Combinatorial Theory A55, 33–48 (1990)
Lonc, Z., Truszczyński, M.: Decomposition of Graphs into Graphs with Bounded Maximum Degrees. Demonstratio Mathematica18, 295–302 (1985)
Mouyart, A.F.: Decomposition of the Complete Hypergraph into Hyperclaws. Discrete Math.76, 137–150 (1989)
Mouyart, A.F., Sterboul, F.: Decomposition of the Complete Hypergraph into Delta-Systems I. Journal of Combinatorial Theory A40, 290–304 (1985)
Tarsi, M.: On the Decomposition of a Graph into Stars. Discrete Math.36, 299–304 (1981)
Wilson, R.W.: Construction and Uses of Pairwise Balanced Designs. In: Combinatorics I (M. Hall and J.M. van Lint, eds.). Math. Centre Tracts55, 18–41 (1974)
Yamamoto, S., Ikeda, H., Shige-eda, S., Ushio, K., Hamada, N.: On Claw-Decomposition of Complete Graphs and Complete Bigraphs. Hiroshima Math. J.5, 33–42 (1975)
Yamamoto, S., Tazawa, S.: Hyperclaw Decomposition of Complete Hypergraphs. Annals of Discrete Mathematics6, 385–391 (1980)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Lonc, Z. Packing, covering and decomposing of a complete uniform hypergraph into delta-systems. Graphs and Combinatorics 8, 333–341 (1992). https://doi.org/10.1007/BF02351590
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02351590