03427nmm a2200481 u 4500001001200000003002700012005001700039007002400056008004100080020001500121020001800136020001500154020001800169020001800187020001500205020001800220050001300238100002000251245007800271260004100349300001900390505004000409505058200449600006801031600004801099653007301147653009701220653004601317653005001363653007301413653004201486700001801528700002001546041001901566989005301585490003801638500003001676776001801706776001501724856008401739082001101823520111101834EB002120351EBX0100000000000000125840800000000000000.0cr|||||||||||||||||||||221028 ||| eng a0080872603 a9781281793119 a0444703284 a9780080872605 a9780444703286 a1281793116 a9786611793111 4aQA166.251 aColbourn, C. J.00aCombinatorial design theorycedited by Charles J. Colbourn, Rudolf Mathon aAmsterdambNorth-Hollandc1987, 1987 axii, 470 pages0 aIncludes bibliographical references0 aFront Cover; Combinatorial Design Theory; Copyright Page; Preface; Acknowledgements; Contents; Chapter 1. The Existence of Symmetric Latin Squares with One Prescribed Symbol in Each Row and Column; Chapter 2. A Fast Method for Sequencing Low Order Non-Abelian Groups; Chapter 3. Pairwise Balanced Designs with Prime Power Block Sizes Exceeding 7; Chapter 4. Conjugate Orthogonal Latin Squares with Equal-Sized Holes; Chapter 5. On Regular Packings and Coverings; Chapter 6. An Inequality on the Parameters of Distance Regular Graphs and the Uniqueness of a Graph Related to M2314aRosa, Alexander / http://id.loc.gov/authorities/names/n8201484414aRosa, Alexander / fast / (OCoLC)fst00086518 aCombinatorial designs and configurations / fast / (OCoLC)fst00868967 aCombinatorial designs and configurations / http://id.loc.gov/authorities/subjects/sh85028803 aConfigurations et scheĢmas combinatoires aConfigurations et schemas combinatoires / ram aKombinatorische Designtheorie / gnd / http://d-nb.info/gnd/4164747-6 aMATHEMATICS / Combinatorics / bisacsh1 aMathon, R. A.1 aRosa, Alexander07aeng2ISO 639-2 bZDB-1-ELCaElsevier eBook collection Mathematics0 aNorth-Holland mathematics studies aFestschrift for Alex Rosa z9780080872605 z008087260340uhttps://www.sciencedirect.com/science/bookseries/03040208/149xVerlag3Volltext0 a511/.6 aCombinatorial 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