Godsil, Christopher David <br/><br/>
Erdos-Ko-Random theorems :  algebraic approaches 

 - Cambridge :   Cambridge University Press,  ©2016. 
 - xvi, 335 p. :  ill. ;  23.5 cm (Hardbound) 
 - Cambridge studies in advanced mathematics ;  149 .
<br/><br/>Includes bibliographical references and index. 
<br/><br/> 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. 
<br/><br/><label>ISBN: </label>9781107128446 
<br/><br/><label>Subjects--Index Terms: </label>Combinatorial analysis Hypergraphs Intersection theory (Mathematics) 
<br/><br/><label>Dewey Class. No.: </label>512  / GOD / B