Abstract
We define a general covering number B(t,k,m,v), discuss its elementary properties, indicate what is known more generally, and give the results of some computer determinations of these numbers.
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
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.
W.H. Mills, On the Covering of Pairs by Quadruples I, J. Combin. Theory Ser. A 13 (1972), 55–78.
W.H. Mills, On the Covering of Pairs by Quadruples II, J. Combin. Theory Ser. A 15 (1973), 138–166.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1980 Springer-Verlag
About this paper
Cite this paper
Stanton, R.G., Bate, J.A. (1980). A computer search for B-coverings. In: Robinson, R.W., Southern, G.W., Wallis, W.D. (eds) Combinatorial Mathematics VII. Lecture Notes in Mathematics, vol 829. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0088898
Download citation
DOI: https://doi.org/10.1007/BFb0088898
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10254-0
Online ISBN: 978-3-540-38376-5
eBook Packages: Springer Book Archive