000			01675nam a2200181 4500
020			_a9781107128446
082			_a512 _bGOD/E
100			_aGodsil, Christopher
245			_aErdős-Ko-Rado theorems : algebraic approaches
260			_aCambridge _bCambridge University press _c2016
300			_a335 p.
520			_aAimed 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. 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
650			_aCombinatorial analysis
650			_aHypergraphs
650			_aIntersection theory (Mathematics)
700			_aMeagher, Karen
942			_cBK
999			_c66915 _d66915