Triple Systems

Hardcover | March 1, 1999

byCharles Colbourn, Alex Rosa

not yet rated|write a review
Triple systems are among the simplest combinatorial designs, and are a natural generalization of graphs. They have connections with geometry, algebra, group theory, finite fields, and cyclotomy; they have applications in coding theory, cryptography, computer science, and statistics. Triplesystems provide in many cases the prototype for deep results in combinatorial design theory; this design theory is permeated by problems that were first understood in the context of triple systems and then generalized. Such a rich set of connections has made the study of triple systems anextensive, but sometimes disjointed, field of combinatorics. This book attempts to survey current knowledge on the subject, to gather together common themes, and to provide an accurate portrait of the huge variety of problems and results. Representative samples of the major syles of proof techniqueare included, as is a comprehensive bibliography.

Pricing and Purchase Info

$415.92 online
$532.50 list price (save 21%)
Ships within 1-3 weeks
Ships free on orders over $25

From the Publisher

Triple systems are among the simplest combinatorial designs, and are a natural generalization of graphs. They have connections with geometry, algebra, group theory, finite fields, and cyclotomy; they have applications in coding theory, cryptography, computer science, and statistics. Triplesystems provide in many cases the prototype fo...

Charles Colbourn is at University of Vermont. Alex Rosa is at McMaster University.

other books by Charles Colbourn

Handbook of Combinatorial Designs, Second Edition
Handbook of Combinatorial Designs, Second Edition

Kobo ebook|Nov 1 2006

$169.79 online$220.41list price(save 22%)
Format:HardcoverPublished:March 1, 1999Publisher:Oxford University PressLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:0198535767

ISBN - 13:9780198535768

Look for similar items by category:

Customer Reviews of Triple Systems

Reviews

Extra Content

Table of Contents

Historical introduction1. Design-theoretic fundamentals2. Existence: direct methods3. Existence:recursive methods4. Isomorphism and invariants5. Enumeration6. Subsystems and holes7. Automorphisms I: small groups8. Automorphisms II: large groups9. Leaves and partial tripls systems10. Excesses and coverings11. Embedding and its variants12. Neighbourhoods13. Configurations14. Intersections15. Large sets and partitions16. Support sizes17. Independent sets18. Chromatic number19. Chromatic index and resolvability20. Orthogonal resolutions21. Nested and derived triple systems22. Decomposability23. Directed triple systems24. Mendelsohn triple systemsBibliographiesIndex