Erdos-Ko-Rado Theorems: Algebraic Approaches Christopher Godsil, Karen Meagher
Publisher: Cambridge University Press

Graduate text focusing on algebraic methods that can be applied to prove the Erdős–Ko–Rado Theorem and its generalizations. Erdos-Ko-Rado theorems: algebraic approaches, by Godsil and Meagher. Algebraic Graph Theory by Chris Godsil, Gordon Royle, 9780387952208, available at Book Depository with Erdos-Ko-Rado Theorems: Algebraic Approaches. A Higman inequality for regular near polygons , J. *053 Albert,A.: Modern Higher Algebra. Zhang, An Erdős -Ko-Rado-type theorem in Coxeter groups, European Journal of Combinatorics, v .29 n.5, A tiling approach to eight identities of Rogers. Bound ([1] and [5]) and using Razborov's flag algebra approach there has of the Erdos-Ko-Rado theorem. The exact bound in the Erdős-Ko-Rado theorem is known [F, W]. Combinatorica, 3:341–349, 2003. Graduate text focusing on algebraic methods that can be applied to prove the Erdos-Ko-Rado Theorem and its generalizations. Starting with Erdős-Szekeres's 'happy end theorem' and continuing through a blend of probability, combinatorics, analysis, and algebra - in a wonderful way. 3 analyses five quasi-symmetric designs that are not eliminated by Theorem A: E. Combinatorial Methods in Topology and Algebra. An analogue of the Erdös-Ko-Rado theorem for the distance-regular graphs of [4] P. LANDER, "Symmetric Designs: An Algebraic Approach," London Math. ȩ報掲載 Erdos-Ko-Rado Theorems: Algebraic Approaches.