Abstract
Frankl and Füredi [11] established that the largest number of 3-subsets of ann-set, for which no four distinct setsA,B,D satisfyA∪B=C∪D, is at most\(\left\lfloor {\frac{{n(n - 1)}}{3}} \right\rfloor\). Chee, Colbourn, and Ling [6] established that this upper bound is met with few exceptions whenn≡0, 1 (mod 3). In this paper, it is established that the upper bound is also met with few exceptions whenn≡2 (mod 3).
Similar content being viewed by others
References
R.J.R. Abel, A.E. Brouwer, C.J. Colbourn, and J.H. Dinitz, Mutually orthogonal latin squares, In: CRC Handbook of Combinatorial Designs, C.J. Colbourn and J.H. Dinitz Eds., CRC Press, Boca Raton, 1996, pp. 111–142.
G.E. Atkin, D.A. Fares, and H.P. Corrales, Coded multipulse position modulation in a noisy optical channel, Microwave Optical Technol. Lett.2 (1989) 336–340.
T. Berger, N. Mehravari, D. Towsley, and J. Wolf, Random multiple-access communications and group testing, IEEE Trans. Commun.32 (1984) 769–778.
T. Beth, D. Jungnickel, and H. Lenz, Design Theory, Cambridge University Press, 1986.
W.J. Bruno, D.J. Balding, E.H. Knill, D. Bruce, C. Whittaker, N. Doggett, R. Stallings, and D.C. Torney, Design of efficient pooling experiments, Genomics26 (1995) 21–30.
Y.M. Chee, C.J. Colbourn, and A.C.H. Ling, Weakly union-free twofold triple systems, Ann. Combin.1 (1997) 215–225.
P.C. Denny, Search and enumeration techniques for incidence structures, M.Sc. Thesis, Department of Computer Science, University of Auckland, 1998.
D.-Z. Du and F.K. Hwang, Combinatorial Group Testing and Its Applications, World Scientific, Singapore, 1993.
P. Erdös, On sequences of integers no one of which divides the product of two others and some related results, Mitt. Forschungsint. Math. Mech.2 (1938) 74–82.
P. Erdös, Problems and results in combinatorial analysis, Congressus Numer.19 (1977) 3–12.
P. Frankl and Z. Füredi, A new extremal property of Steiner triple systems, Discrete Math.48 (1984) 205–212.
H.D.O.F. Gronau and R.C. Mullin, PBDs: Recursive constructions, In: CRC Handbook of Combinatorial Designs, C.J. Colbourn and J.H. Dinitz Eds., CRC Press, 1996, pp. 193–203.
R.M. Wilson, An existence theory for pairwise balanced designs I: Composition theorems and morphisms, J. Combin. Theory, Ser. A13 (1971) 220–245.
S. Zhao, Application of BIBDs in MT-MFSK signal set design for multiplexing bursty sources, Ph.D. Thesis, University of Technology, Sydney, 1998.
S. Zhao, K.W. Yates, and K. Yasukawa, Application of Kirkman designs in joint detection multiple access schemes, In: Proc. Int. Symp. Spread Spectrum Techniques and Applications, Vol. 2, IEEE, 1996, pp. 857–861.
Author information
Authors and Affiliations
Additional information
The research was supported in part by the US Army Research Office under Grant DAAG55-98-1-0272.
Rights and permissions
About this article
Cite this article
Colbourn, C.J. Weakly union-free maximum packings. Annals of Combinatorics 3, 43–52 (1999). https://doi.org/10.1007/BF01609874
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01609874