Graphical t-designs via polynomial Kramer-Mesner matrices

Discrete Mathematics

Volumn 197-198, Issue , 1999, Pages 83-109

  Betten, Anton ^a   Klin, Mikhail ^b   Laue, Reinhard ^a   Wassermann, Alfred ^a  

^a UNIVERSITY OF BAYREUTH   (Germany)

^b BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

Graphical t designs; Maximal subgroups of symmetric groups; Polynomial kramer Mesner matrices

Indexed keywords

EID: 18544409723     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0012-365x(99)90045-6     Document Type: Article

References (24)

1. W.O. Alltop, On the construction of block designs, J. Combin. Theory 1 (1966) 501-502.
2. A. Betten, A. Kerber, R. Laue, A. Wassermann, Simple 8-designs with small parameters, Designs, Codes and Cryptography 15 (1998) 5-27.
3. P.J. Cameron, J.H. van Lint, Designs, Graphs, Codes and their Links, London Math. Soc. Student Texts vol. 22, Cambridge Univ. Press, Cambridge, 1991.
4. P.J. Cameron, C.E. Praeger, Block-transitive t-designs I: point-imprimitive designs, Discrete Math. 118 (1993) 33-43.
5. Y.M. Chee, Graphical t-designs with block sizes three and four, Discrete Math. 91 (1991) 201-206.
6. Y.M. Chee, On graphical quintuple systems, J. Symbolic Comput. 13 (1992) 677-681.
7. Y.M. Chee, The existence of a simple 3 - (28, 5, 30) design, Discrete Math. 118 (1993) 251-252.
8. Y.M. Chee, Graphical designs, in: The CRC Handbook of Combinatorial Designs, C.J. Colbourn, J.H. Dinitz (Eds.), CRC Press, Boca Raton, New York, 1996, pp. 367-369.
9. L.G. Chouinard II, E.S. Kramer, D.L. Kreher, Graphical t-wise balanced designs, Discrete Math. 46 (1983) 227-240.
10. J.D. Dixon, B. Mortimer, Permutation Groups, Springer, Berlin, 1996.
11. L.H.M.E. Driessen, t-designs, t≥3, Technical Report, Department of Mathematics, Eindhoven University of Technology, Netherlands, 1978.
12. F. Harary, Graph Theory, Addison-Wesley, Reading MA, 1969.
13. H.A. Jung, Zu einem Isomorphiesatz von Whitney für Graphen, Math. Ann. 164 (1966) 270-271.
14. M.H. Klin, On an infinite family of maximal subgroups of symmetric groups, Trudy Nikolaevskogo Korablestroitelnogo Instituta 41 (1970) 148-151 (in Russian).
15. M.H. Klin, Investigations of algebras of invariant relations of certain classes of permutation groups, Dissertation, Nikolaev, 1974 (in Russian).
16. 3 (3, 5, 21) using graphs, Discrete Math. 81 (1990) 223-224.
17. E.S. Kramer, D.M. Mesner, t-designs on hypergraphs, Discrete Math. 15 (1976) 263-296.
18. D.L. Kreher, t-designs, t≥3, in: The CRC Handbook of Combinatorial Designs, C.J. Colbourn, J.H. Dinitz (Eds.), CRC Press Boca Raton, New York, 1996, pp. 47-66.
19. R. Laue, Eine konstruktive Version des Lemmas von Burnside, Bayreuther Mathem. Schriften 28 (1989) 111-125.
20. M.W. Liebeck, C.E. Praeger, J. Saxl, A classification of the maximal subgroups of the finite alternating and symmetric groups, J. Algebra 111 (1987) 365-383.
21. J.H. van Lint, R.M. Wilson, A Course in Combinatorics, Cambridge University Press, Cambridge, 1992.
22. B. Schmalz, The t-designs with prescribed automorphism group, new simple 6-designs, J. Combin. Des. 1 (1993) 125-170.
23. H. Whitney, Congruent graphs and the connectivity of graphs, Amer. J. Math. 54 (1932) 150-168.
24. H. Wielandt, Finite Permutation Groups, Academic Press, New York, 1964.