Lower bounds for coverings of pairs by large blocks

Combinatorica volume 9, pages217–225(1989)Cite this article

Abstract

Letn≧k≧t be positive integers, andX—a set ofn elements. LetC(n, k, t) be the smallest integerm such that there existm k-tuples ofX B 1 B 2,...,B m with the property that everyt-tuple ofX is contained in at least oneB i . It is shown that in many cases the standard lower bound forC(n, k, 2) can be improved (k sufficiently large,n/k being fixed). Some exact values ofC(n, k, 2) are also obtained.

This is a preview of subscription content, access via your institution.

Access options

Buy single article

Instant access to the full article PDF.

US$ 39.95

Tax calculation will be finalised during checkout.

References

  1. [1]

    J. Schönheim, On coverings,Pacific J. Math.,14 (1964), 1405–1411.

    Google Scholar 

  2. [2]

    J. Schönheim, On maximal systems ofk-tuples,Studia Sci. Math. Hung.,1 (1966), 363–368.

    Google Scholar 

  3. [3]

    P. Turán, Egy gráfelméleti szélsőérték feladatról,Mat. Fiz. Lapok,48 (1941), 436–452.

    Google Scholar 

  4. [4]

    W. H. Mills, Covering problems,Proc. of the Foueth. South. Conf. on Comb., Graph Theory and Comp., Florida Atlantic University, Boca Raton, Florida (1974), 563–581.

    Google Scholar 

  5. [5]

    W. H. Mills, Covering designs I: Coverings by a small number of subsets,Ars Combinatoria,8 (1979), 199–315.

    Google Scholar 

  6. [6]

    D. T. Todorov, Some coverings derived from finite planes,Coll. Math. Soc. János Bolyai,37 (1981), 697–710.

    Google Scholar 

  7. [7]

    D. T. Todorov, A method for constructing coverings,Math. Notes,35 (1984), 869–876.

    Google Scholar 

  8. [8]

    D. T. Todorov, On the covering of pairs by 13 blocks,C.R. Bulg. Acad. Sci.,38 (1985), 691–694.

    Google Scholar 

  9. [9]

    V. Rödl, On a packing and covering problem,Europ. J. Comb.,5 (1985), 69–78.

    Google Scholar 

  10. [10]

    N. N. Kuzjurin, Asymptotic research of the covering problem,Cybernetic problems,37 (1980), 19–56.

    Google Scholar 

  11. [11]

    P. Erdős andH. Hanani, On a limit theorem in combinatorial analysis,Publ. Math. Debrecen,10 (1963), 10–13.

    Google Scholar 

Download references

Author information

Affiliations

  1. Department of Mathematics, K. Marx-Institute of Economics, 1100, Sofia, Bulgaria

    D. T. Todorov

Authors
  1. D. T. Todorov
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Todorov, D.T. Lower bounds for coverings of pairs by large blocks. Combinatorica 9, 217–225 (1989). https://doi.org/10.1007/BF02124682

Download citation

Keywords

  • coverings
  • affine planes
  • projective planes

AMS subject classification code (1980)

  • 05 B 40