Abstract
Deciding whether a triple system with λ=3 can be decomposed, or partitioned, into triple systems with smaller λ is NP-complete; this contrasts with the polynomial time algorithm for decomposing triple systems with λ=2. Two extensions of this result are examined here — to triple systems without repeated blocks, and to triple systems with λ=4.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
C.J. Colbourn, Some NP-complete problems on graph decompositions, Proc. Nineteenth Allerton Conference on Communications, Control, and Computing, (1981), 741–745.
C.J. Colbourn, Embedding partial Steiner triple systems is NP-complete, J. Combinatorial Theory A, to appear.
C.J. Colbourn and M.J. Colbourn, The computational complexity of decomposing block designs, submitted for publication.
C.J. Colbourn and A. Rosa, Indecomposable triple systems with λ=4, submitted for publication.
A.B. Cruse, On embedding incomplete symmetric Latin squares, J. Comb. Theory A, 16 (1974), 18–22.
I. Holyer, The NP-completeness of edge colouring, SIAM J. Computing 10 (1981), 718–720.
D. König, Theorie der Endlichen und Unendlichen Graphen, Teubner, Leipzig, (1936).
E.S. Kramer, Indecomposable triple systems, Discrete Math. 8 (1974) 173–180.
D. Levin and Z. Galil, NP-complete problem no. 798016, submitted for publication.
J. Petersen, Die Theorie der regularen Graphen, Acta Math. 15 (1891), 193–220.
A. Rosa, Algebraic properties of designs and recursive constructions Proc. Conf. Algebraic Aspects of Combinatorics, Utilitas Math. Publishing Co., Winnipeg, Canada, (1975) 183–202.
A. Rosa, Intersection properties of Steiner systems, Annals of Discrete Math. 7 (1980) 115–128.
Editor information
Rights and permissions
Copyright information
© 1983 Springer-Verlag
About this paper
Cite this paper
Colbourn, C.J., Colbourn, M.J. (1983). Decomposition of block designs: Computational issues. In: Casse, L.R.A. (eds) Combinatorial Mathematics X. Lecture Notes in Mathematics, vol 1036. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0071515
Download citation
DOI: https://doi.org/10.1007/BFb0071515
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-12708-6
Online ISBN: 978-3-540-38694-0
eBook Packages: Springer Book Archive