Description
Combinatorial design theory is a vibrant area of combinatorics, connecting graph theory, number theory, geometry, and algebra with applications in experimental design, coding theory, and numerous applications in computer science.
This volume is a collection of forty-one state-of-the-art research articles spanning all of combinatorial design theory. The articles develop new methods for the construction and analysis of designs and related combinatorial configurations; both new theoretical methods, and new computational tools and results, are presented. In particular, they extend the current state of knowledge on Steiner systems, Latin squares, one-factorizations, block designs, graph designs, packings and coverings, and develop recursive and direct constructions.
The contributions form an overview of the current diversity of themes in design theory for those peripherally interested, while researchers in the field will find it to be a major collection of research advances. The volume is dedicated to Alex Rosa, who has played a major role in fostering and developing combinatorial design theory.
Chapter
Chapter 2. A Fast Method for Sequencing Low Order Non-Abelian Groups
pp.:
40 – 56
Chapter 3. Pairwise Balanced Designs with Prime Power Block Sizes Exceeding 7
pp.:
56 – 78
Chapter 4. Conjugate Orthogonal Latin Squares with Equal-Sized Holes
pp.:
78 – 94
Chapter 5. On Regular Packings and Coverings
pp.:
94 – 114
Chapter 6. An Inequality on the Parameters of Distance Regular Graphs and the Uniqueness of a Graph Related to M23
pp.:
114 – 120
Chapter 7. Partitions into Indecomposable Triple Systems
pp.:
120 – 132
Chapter 8. Cubic Neighbourhoods in Triple Systems
pp.:
132 – 150
Chapter 9. The Geometry of Subspaces of an S(λ;2,3,v)
pp.:
150 – 158
Chapter 10. On 3-Blocking Sets in Projective Planes
pp.:
158 – 166
Chapter 11. Star Sub-Ramsey Numbers
pp.:
166 – 178
Chapter 12. Colored Packing of Sets
pp.:
178 – 192
Chapter 13. Balanced Room Squares from Finite Geometries and their Generalizations
pp.:
192 – 202
Chapter 14. On the Number of Pairwise Disjoint Blocks in a Steiner System
pp.:
202 – 210
Chapter 15. On Steiner Systems S(3,5,26)
pp.:
210 – 220
Chapter 16. Halving the Complete Design
pp.:
220 – 238
Chapter 17. Outlines of Latin Squares
pp.:
238 – 256
Chapter 18. The Flower Intersection Problem for Steiner Triple Systems
pp.:
256 – 262
Chapter 19. Embedding Totally Symmetric Quasigroups
pp.:
262 – 272
Chapter 20. Cyclic Perfect One Factorizations of K2n
pp.:
272 – 286
Chapter 21. On Edge but not Vertex Transitive Regular Graphs
pp.:
286 – 300
Chapter 22. A Product Theorem for Cyclic Graph Designs
pp.:
300 – 310
Chapter 23. A New Class of Symmetric Divisible Designs
pp.:
310 – 314
Chapter 24. 2-(25,10,6) Designs Invariant under the Dihedral Group of Order Ten
pp.:
314 – 320
Chapter 25. On the Steiner Systems S(2,4,25) Invariant under a Group of Order 9
pp.:
320 – 328
Chapter 26. Simple 5-(28,6,λ) Designs from PSL 2(27)
pp.:
328 – 332
Chapter 27. The Existence of Partitioned Balanced Tournament Designs of Side 4n+3
pp.:
332 – 352
Chapter 28. The Existence of Partitioned Balanced Tournament Designs
pp.:
352 – 366
Chapter 29. Constructions for Cyclic Steiner 2-Designs
pp.:
366 – 376
Chapter 30. On the Spectrum of Imbrical Designs
pp.:
376 – 384
Chapter 31. Some Remarks on n-Clusters on Cubic Curves
pp.:
384 – 392
Chapter 32. A Few More BIBD’s with k = 6 and λ = 1
pp.:
392 – 398
Chapter 33. Isomorphism Problems for Cyclic Block Designs
pp.:
398 – 406
Chapter 34. Multiply Perfect Systems of Difference Sets
pp.:
406 – 422
Chapter 35. Some Remarks on Focal Graphs
pp.:
422 – 432
Chapter 36. Some Perfect One-Factorizations of K14
pp.:
432 – 450
Chapter 37. A Construction for Orthogonal Designs with Three Variables
pp.:
450 – 454
Chapter 38. Ismorphism Classes of Small Covering Designs with Block Size Five
pp.:
454 – 462
Chapter 39. Graphs which are not Leaves of Maximal Partial Triple Systems
pp.:
462 – 474
Chapter 40. Symmetric 2-( 31,10,3) Designs with Automorphisms of Order Seven
pp.:
474 – 478
Chapter 41. Embeddings of Steiner Systems S(2,4,v)
pp.:
478 – 484