Erdõs–Ko–Rado Theorems: Algebraic Approaches
Cambridge University Press (Verlag)
978-1-107-12844-6 (ISBN)
Aimed at graduate students and researchers, this fascinating text provides a comprehensive study of the Erdős–Ko–Rado Theorem, with a focus on algebraic methods. The authors begin by discussing well-known proofs of the EKR bound for intersecting families. The natural generalization of the EKR Theorem holds for many different objects that have a notion of intersection, and the bulk of this book focuses on algebraic proofs that can be applied to these different objects. The authors introduce tools commonly used in algebraic graph theory and show how these can be used to prove versions of the EKR Theorem. Topics include association schemes, strongly regular graphs, the Johnson scheme, the Hamming scheme and the Grassmann scheme. Readers can expand their understanding at every step with the 170 end-of-chapter exercises. The final chapter discusses in detail 15 open problems, each of which would make an interesting research project.
Christopher Godsil is a professor in the Combinatorics and Optimization Department at the University of Waterloo, Ontario. He authored (with Gordon Royle) the popular textbook Algebraic Graph Theory. He started the Journal of Algebraic Combinatorics in 1992 and he serves on the editorial board of a number of other journals, including the Australasian Journal of Combinatorics and the Electronic Journal of Combinatorics. Karen Meagher is an associate professor in the Department of Mathematics and Statistics at the University of Regina, Saskatchewan, Canada. Her research area is graph theory and discrete mathematics in which she has published around 25 journal articles.
Preface; 1. The Erdős–Ko–Rado Theorem; 2. Bounds on cocliques; 3. Association schemes; 4. Distance-regular graphs; 5. Strongly regular graphs; 6. The Johnson scheme; 7. Polytopes; 8. The exact bound; 9. The Grassmann scheme; 10. The Hamming scheme; 11. Representation theory; 12. Representations of symmetric group; 13. Orbitals; 14. Permutations; 15. Partitions; 16. Open problems; Glossary of symbols; Glossary of operations and relations; References; Index.
| Reihe/Serie | Cambridge Studies in Advanced Mathematics |
|---|---|
| Zusatzinfo | Worked examples or Exercises; 5 Line drawings, unspecified |
| Verlagsort | Cambridge |
| Sprache | englisch |
| Maße | 158 x 235 mm |
| Gewicht | 620 g |
| Themenwelt | Mathematik / Informatik ► Mathematik ► Algebra |
| Mathematik / Informatik ► Mathematik ► Graphentheorie | |
| ISBN-10 | 1-107-12844-7 / 1107128447 |
| ISBN-13 | 978-1-107-12844-6 / 9781107128446 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
