Erdos-Ko-Rado Theorems: Algebraic Approaches - pr_36854

Erdos-Ko-Rado Theorems: Algebraic Approaches

By Christopher Godsil, Karen Meagher



Or 4 payments of $38.40 with

delivery message Free delivery for orders over $49.99

Add to Wish List
Delivered in 10 - 14 days
Available for Click and Collect
Aimed at graduate students and researchers, this fascinating text provides a comprehensive study of the Erdos-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.

Product code: 9781107128446

ISBN 9781107128446
No. Of Pages 350
Dimensions (HxWxD in mm) H235xW158xS23
Publisher Cambridge University Press
Series Cambridge Studies in Advanced Mathematics
The Erdos-Ko-Rado Theorem is a fundamental result in combinatorics. Aimed at graduate students and researchers, this comprehensive text shows how tools from algebraic graph theory can be applied to prove the EKR Theorem and its generalizations. Readers can test their understanding at every step with the end-of-chapter exercises.