Abstract
Previous work on the λ-μ problem is refined to handle the case of 12 varieties. The utility of a restricted version of the problem is suggested.
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
N.G. de Bruijn and P. Erdös, On a Combinatorial Problem. Nederl. Akad. Wetensch. Indag. Math. 10 (1948), 421–423.
J.G. Kalbfleisch and R.G. Stanton, Maximal and Minimal Coverings of (k-1)-tuples by k-tuples, Pacific J. Math., 26 (1968), 131–140.
R.G. Stanton and J.G. Kalbfleisch, the λ-μ Problem: λ=1 and μ=3, Proc. Second Chapel Conf. on Combinatorics, Chapel Hill (1972), 451–462.
D.R. Woodall, The λ-μ Problem, J. London Math. Soc. (2), 1 (1968), 505–519.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1976 Springer-Verlag
About this paper
Cite this paper
Stanton, R.G., Dirksen, P.H. (1976). Computation of g(1,3;12). In: Casse, L.R.A., Wallis, W.D. (eds) Combinatorial Mathematics IV. Lecture Notes in Mathematics, vol 560. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0097385
Download citation
DOI: https://doi.org/10.1007/BFb0097385
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08053-4
Online ISBN: 978-3-540-37537-1
eBook Packages: Springer Book Archive