Skip to main content
SpringerLink
Log in

Regular sets and quasi-symmetric 2-designs

  • Conference paper
  • First Online:
Combinatorial Theory

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

Abstract

The paper presents a classification of quasi-symmetric 2-designs, and sufficient parameter information to generate a list of all feasible "exceptional" parameter sets for such designs with at most 40 points. The main tool is the concept of a regular set in a strongly regular graph.

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 34.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 46.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. H. Beker and W. Haemers, 2-designs having an intersection number k-n, J. Combin. Theory (Ser. A) 28 (1980), 64–82.

    Article  MathSciNet  MATH  Google Scholar 

  2. W.G. Bridges and M.S. Shrikhande, Special partially balanced incomplete block designs and associated graphs, Discrete Math. 9 (1974), 1–18.

    Article  MathSciNet  MATH  Google Scholar 

  3. P.J. Cameron, Extending symmetric designs, J. Combin. Theory 14 (1973), 215–220.

    Article  MathSciNet  MATH  Google Scholar 

  4. P.J. Cameron, Biplanes, Math. Z. 131 (1973), 85–101.

    Article  Google Scholar 

  5. P.J. Cameron and J.H. van Lint, Graphs, Codes and Designs. London Math.Soc. Lecture Note Series 43, Cambridge Univ. Press 1980.

    Google Scholar 

  6. P. Delsarte, An algebraic approach to the association schemes of coding theory, Phil. Res. Rep. Suppl. 10 (1973), 1–97.

    MathSciNet  MATH  Google Scholar 

  7. J.M. Goethals and J.J. Seidel, Strongly regular graphs derived from combinatorial designs, Can. J. Math. 22 (1970), 597–614.

    Article  MathSciNet  MATH  Google Scholar 

  8. M. Hall, jr., and W.S. Connor, An embedding theorem for balanced incomplete block designs, Can. J. Math. 6 (1953), 35–41.

    Article  MathSciNet  MATH  Google Scholar 

  9. X. Hubaut, Strongly regular graphs. Discrete Math. 13 (1975), 357–381.

    Article  MathSciNet  MATH  Google Scholar 

  10. D.R. Hughes and F.C. Piper, On resolutions and Bose's theorem, Geom. dedicata 5 (1976), 129–133.

    Article  MathSciNet  MATH  Google Scholar 

  11. A. Neumaier, Strongly regular graphs with smallest eigenvalue-m, Arch. Math. 33 (1979), 392–400.

    Article  MathSciNet  MATH  Google Scholar 

  12. A. Neumaier, t 1/2-designs, J. Combin. Theory (Ser. A) 28 (1980), 226–248.

    Article  MathSciNet  MATH  Google Scholar 

  13. A. Neumaier, Regular cliques in graphs and special 1 1/2-designs. In: Finite Geometries and Designs, London Math. Soc. Lecture Note Series 49, Cambridge Univ. Press 1981, pp. 244–259.

    Google Scholar 

  14. A. Neumaier, New inequalities for the parameters of an association scheme. In: Combinatorics and Graph Theory, Lecture Notes in Mathematics 885, Springer Verlag, 1981, pp. 365–367.

    Google Scholar 

  15. D. Raghavarao, Constructions and Combinatorial Problems in Design of Experiments. Wiley, New York 1971.

    MATH  Google Scholar 

  16. J.J. Seidel, Strongly regular graphs, an introduction. In: Surveys in Combinatorics, London Math. Soc. Lecture Note Series 38, Cambridge Univ. Press 1979, pp. 157–180.

    Google Scholar 

  17. H.A. Wilbrink and A.E. Brouwer, A (57, 14, 1) strongly regular graph does not exist. Math. Centrum Report ZW 121/78, Amsterdam 1978.

    Google Scholar 

  18. E. Witt, Über Steinersche Systeme, Abh. Math. Sem. Hamburg Univ. 12 (1938), 265–275.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Angewandte Mathematik der Universität Freiburg i.Br., Hermann-Herder-Straße 10, D-7800, Freiburg i.Br.

    Dr. A. Neumaier

Authors
  1. Dr. A. Neumaier
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Dieter Jungnickel Klaus Vedder

Rights and permissions

Reprints and permissions

Copyright information

© 1982 Springer-Verlag

About this paper

Cite this paper

Neumaier, A. (1982). Regular sets and quasi-symmetric 2-designs. In: Jungnickel, D., Vedder, K. (eds) Combinatorial Theory. Lecture Notes in Mathematics, vol 969. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0062999

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-11971-5

  • Online ISBN: 978-3-540-39380-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation