Skip to main content
SpringerLink
Log in

Old and new results on perfect coverings

  • Invited Addresses
  • Conference paper
  • First Online:
Combinatorial Mathematics IX

Part of the book series: Lecture Notes in Mathematics ((LNM,volume 952))

  • 312 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 44.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 59.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. N.G. de Bruijn and P. Erdös, On a combinatorial problem, Nederl. Akad. Wetensch. Indag. Math. 10 (1948), 421–423.

    MATH  Google Scholar 

  2. A. Hartman, R.C. Mullin, and D.R. Stinson, Exact covering configurations and Steiner systems, J. London Math. Soc. (to appear).

    Google Scholar 

  3. R.C. Mullin, R.G. Stanton, and D.R. Stinson, Perfect pair-coverings and an algorithm for certain (1–2) factorizations of the complete graph K2s+1, Ars Combinatoria 12 (1981) (to appear).

    Google Scholar 

  4. R.G. Stanton, J.L. Allston, and D.D. Cowan, Determination of an exact covering by triples, Cong. Num. 31 (1981), 253–258.

    MathSciNet  MATH  Google Scholar 

  5. R.G. Stanton, J.L. Allston, and D.D. Cowan, Pair-coverings with restricted largest block length, Ars Combinatoria 11 (1981), 85–98.

    MathSciNet  MATH  Google Scholar 

  6. R.G. Stanton and P.H. Dirksen, Computation of g(1,3;12), Combinatorial Mathematics IV, LNiM 560, Springer-Verlag, Berlin, Heidelberg, New York (1976), 232–234.

    Chapter  Google Scholar 

  7. R.G. Stanton, J.L. Allston, P.D. Eades and D.D. Cowan, Computation of the g(1,3;20) cover, J. Combinatorics, Information and System Sciences 6–2 (1980), 1–5.

    MathSciNet  Google Scholar 

  8. R.G. Stanton, P.D. Eades, G.H.J. van Rees and D.D. Cowan, Computation of some exact g-coverings, Utilitas Math. 18 (1980), 269–282.

    MathSciNet  MATH  Google Scholar 

  9. R.G. Stanton and I.P. Goulden, Graph factorization, general triple systems, and cyclic triple systems, Aequationes Math 22 (1981), 1–28.

    Article  MathSciNet  MATH  Google Scholar 

  10. R.G. Stanton and J.G. Kalbfleisch, The λ-μ problem: λ = 1 and μ = 3, Proc. Second Chapel Hill Conf. on Combinatorics, Univ. of North Carolina (1972), 451–462.

    Google Scholar 

  11. D.R. Woodall, The λ-μ problem, J. London Math. Soc. 1 (1968), 505–519.

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Manitoba, Winnipeg, Manitoba, Canada

    R. G. Stanton

Authors
  1. R. G. Stanton
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Elizabeth J. Billington Sheila Oates-Williams Anne Penfold Street

Rights and permissions

Reprints and permissions

Copyright information

© 1982 Springer-Verlag

About this paper

Cite this paper

Stanton, R.G. (1982). Old and new results on perfect coverings. In: Billington, E.J., Oates-Williams, S., Street, A.P. (eds) Combinatorial Mathematics IX. Lecture Notes in Mathematics, vol 952. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0061977

Download citation

  • DOI: https://doi.org/10.1007/BFb0061977

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-11601-1

  • Online ISBN: 978-3-540-39375-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation