Case studies and new results in combinatorial enumeration

Journal of Combinatorial Designs

Volumn 8, Issue 4, 2000, Pages 239-260

  Denny, P C ^a   Gibbons, P B ^a  

^a UNIVERSITY OF AUCKLAND   (New Zealand)

Author keywords

Backtracking; Block design; Incidence structure; Isomorph rejection; Triple system

Indexed keywords

EID: 1542413376     PISSN: 10638539     EISSN: None     Source Type: Journal    
DOI: 10.1002/1520-6610(2000)8:4<239::AID-JCD3>3.0.CO;2-C     Document Type: Article

References (40)

1. W.O. Alltop, Extending t-designs, J Combin Theory A 18 (1975), 177-186.
2. G. Brinkmann, Fast generation of cubic graphs, J Graph Theory 23, No. 2 (1996), 139-149.
3. Y.M. Chee, C.J. Colbourn, and A.C.H. Ling, Weakly union-free twofold triple systems, Ann Combin 1 (1997), 215-225.
4. C.J. Colbourn and A. Rosa, Directed and Mendelsohn triple systems, in: Contemporary design theory: A collection of surveys, Ed. J.H. Dinitz and D.R. Stinson, John Wiley, New York, 1992, pp. 97-136.
5. P.C. Denny, Search and enumeration techniques for incidence structures, MSc Thesis, University of Auckland, 1998.
6. Published as CDMTCS Technical Report #85, available at http://www.cs.auckland.ac.nz/CDMTCS/
7. P.C. Denny and R. Mathon, A census of t-(t + 8, t + 2, 4) designs, 2 ≤ t ≤ 4, J Statist Plann Inference, to appear.
8. 12, J Combin Des 2 (1994), 273-285.
9. J.H. Dinitz and D.R. Stinson, A fast algorithm for finding strong starters, SIAM J Alg Disc Meth 2 (1981), 50-56.
10. P. Dukes and E. Mendelsohn, Skew-orthogonal Steiner triple systems, J Combin Designs 7 (1999), 431-440.
11. K. Engel and H.-D.O.F Gronau, On 2-(6,3,λ) designs, Rostock Math Kolloq 34 (1988), 37-48.
12. I.A. Faradzhev, Constructive enumeration of combinatorial objects, Problemes Combinatoires et Theorie des Graphes Colloque Internat. CNRS 260. CNRS Paris, 1978, 131-135.
13. P. Frankl and Z. Furedi, A new extremal property of Steiner triple systems, Discrete Math 48 (1984), 205-212.
14. B. Ganter, R. Mathon, and A. Rosa, A complete census of (10,3,2)-block designs and of Mendelsohn triple systems of order 10. I. Mendelsohn triple systems without repeated blocks, in: Proc Seventh Manitoba Conf Numerical Math and Computing, 1977, pp. 383-398.
15. -, A complete census of (10,3,2)-block designs and of Mendelsohn triple systems of order 10. II. Mendelsohn triple systems with repeated blocks, in: Proc Eighth Manitoba Conf Numerical Math and Computing, 1978, pp. 181-204.
16. P.B. Gibbons, Computing techniques for the construction and analysis of block designs, PhD Thesis, University of Toronto, 1976.
17. -, Computational methods in design theory, in: CRC Handbook of Combinatorial Designs, Ed. C.J. Colbourn and J.H. Dinitz, CRC Press, 1996, pp. 718-740.
18. P.B. Gibbons and R.A. Mathon, Construction methods for Bhaskar Rao and related designs, J Austral Math Soc (A) 42 (1987), 5-30.
19. P.B. Gibbons, R.A. Mathon, and D.G. Cornell, Computing techniques for the construction and analysis of block designs, Utilitas Math 11 (1977), 161-192.
20. T. Griggs, J. Murphy, and J.S. Phelan, Anti-Pasch Steiner triple systems, J Combin Inf Syst Sci 15 (1990), 79-84.
21. H. Gropp, Configurations, in: CRC Handbook of Combinatorial Designs, Ed. C.J. Colbourn and J.H. Dinitz, CRC Press, 1996, pp. 253-255.
22. T. Grüner, R. Laue, and M. Meringer, Algorithms for group actions applied to graph generation, DIMACS Ser Discrete Math Theoret Comput Sci, 28, Amer Math Soc, Providence, RI, 1997.
23. F. Harary and E.M. Palmer, Graphical enumeration, Academic Press, New York, 1973.
24. A.V. Ivanov, Constructive enumeration of incidence systems, Ann Discrete Math 26 (1985), 227-246.
25. E.S. Kramer and D.S. Mesner, t-Designs on hypergraphs, Discrete Math 15 (1976), 263-296.
26. D.L. Kreher and S.P. Radziszowski, Constructing 6-(14,7,4) designs, Contemporary Math 111 (1990), 137-151.
27. C.W.H. Lam, L. Thiel, and S. Swiercz, The non-existence of finite projective planes of order 10, Canad J Math 41 (1989), 1117-1123.
28. R. Mathon, private communication.
29. R. Mathon, Computational methods in design theory, in: Computational and Constructive Design Theory, Ed. W.D. Wallis, Kluwer, 1996, pp. 29-48.
30. R. Mathon and A. Rosa, 2-(v, k, λ) designs of small order, in: CRC Handbook of Combinatorial Designs, Ed. C.J. Colbourn and J.H. Dinitz, CRC Press, 1996, pp. 3-41.
31. B. McKay, private communication.
32. B.D. McKay, Isomorph-free exhaustive generation, J Algorithms 26 (1998), 306-324.
33. B.D. McKay and S.P. Radziszowski, The nonexistence of 4-(12,6,6) designs, in: Computational and Constructive Design Theory, Ed. W.D. Wallis, Kluwer, 1996, pp. 177-188.
34. M. Meringer, Fast generation of regular graphs and construction of cages, J Graph Theory 30 (1999), no. 2, 137-146.
35. C. Pietsch, Numbers of nonisomorphic block designs found with DESY, unpublished.
36. -, On the enumeration of 2-(7,3,λ) block designs, J Combin Math Combin Comput 16 (1994), 103-114.
37. R.C. Read, Every one a winner, Ann Discrete Math 2 (1978), 107-120.
38. R.M. Robinson, The structure of certain triple systems, Math Comput 20 (1975), 223-241.
39. D.R. Stinson and R. Wei, Some results on quadrilaterals in Steiner triple systems, Discrete Math. 105 (1992), 207-219.
40. J.D. Swift, Isomorph rejection in exhaustive search techniques, Proc A.M.S. Symp Appl Math 10 (1958), 195-200.