|
|
|||
|
||||
OverviewFull Product DetailsAuthor: Christopher Godsil (University of Waterloo, Ontario) , Karen Meagher (University of Regina, Saskatchewan, Canada)Publisher: Cambridge University Press Imprint: Cambridge University Press Volume: 149 Dimensions: Width: 15.80cm , Height: 2.30cm , Length: 23.50cm Weight: 0.620kg ISBN: 9781107128446ISBN 10: 1107128447 Pages: 350 Publication Date: 24 November 2015 Audience: Professional and scholarly , College/higher education , Professional & Vocational , Postgraduate, Research & Scholarly Format: Hardback Publisher's Status: Active Availability: Manufactured on demand We will order this item for you from a manufactured on demand supplier. Table of ContentsPreface; 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.Reviews'This is an excellent book about Erdos-Ko-Rado (EKR) Theorems and how to prove them by algebraic methods ... The writing style is reader-friendly, and proofs are well organized and easily followed. Also, every chapter contains Exercises and Notes, which are very useful for expanding understanding and finding further reading. The reviewer recommends this book without hesitation to all graduate students and researchers interested in combinatorics.' Norihide Tokushige, MathSciNet 'This is an excellent book about Erdos-Ko-Rado (EKR) Theorems and how to prove them by algebraic methods ... The writing style is reader-friendly, and proofs are well organized and easily followed. Also, every chapter contains Exercises and Notes, which are very useful for expanding understanding and finding further reading. The reviewer recommends this book without hesitation to all graduate students and researchers interested in combinatorics.' Norihide Tokushige, MathSciNet 'This is an excellent book about Erdos-Ko-Rado (EKR) Theorems and how to prove them by algebraic methods ... The writing style is reader-friendly, and proofs are well organized and easily followed. Also, every chapter contains Exercises and Notes, which are very useful for expanding understanding and finding further reading. The reviewer recommends this book without hesitation to all graduate students and researchers interested in combinatorics.' Norihide Tokushige, MathSciNet 'This is an excellent book about Erdos-Ko-Rado (EKR) Theorems and how to prove them by algebraic methods … The writing style is reader-friendly, and proofs are well organized and easily followed. Also, every chapter contains Exercises and Notes, which are very useful for expanding understanding and finding further reading. The reviewer recommends this book without hesitation to all graduate students and researchers interested in combinatorics.' Norihide Tokushige, MathSciNet Author InformationChristopher 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. Tab Content 6Author Website:Countries AvailableAll regions |
||||