# Erdos-ko-rado theorems: algebraic approaches

##### By: Godsil, Chris

##### Contributor(s): Meagher, Karen [Co-author]

Material type: TextPublisher: Cambridge Cambridge University Press 2016Description: xvi, 335 p. Includes references and indexISBN: 9781107128446Subject(s): Combinatorial analysis | Hypergraphs | Intersection theory: mathematicsDDC classification: 512 Summary: 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 the 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. • Comprehensive look at the EKR Theorem covering many areas and techniques • Self-contained chapters and exercises make this text suitable for a graduate course • Final chapter outlines open research problems to inspire future research www.cambridge.org/catalogue/catalogue.asp?isbn=9781107128446Item type | Current location | Item location | Collection | Call number | Status | Date due | Barcode |
---|---|---|---|---|---|---|---|

Books | Vikram Sarabhai Library General Stacks | Slot 1360 (0 Floor, East Wing) | Non-fiction | 512 G6E7 (Browse shelf) | Available | 194913 |

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 the 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.

• Comprehensive look at the EKR Theorem covering many areas and techniques

• Self-contained chapters and exercises make this text suitable for a graduate course

• Final chapter outlines open research problems to inspire future research

www.cambridge.org/catalogue/catalogue.asp?isbn=9781107128446

There are no comments for this item.