Erdos-Ko-Rado Theorems: Algebraic Approaches by Christopher Godsil, Karen Meagher
Erdos-Ko-Rado Theorems: Algebraic Approaches Christopher Godsil, Karen Meagher ebook
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. A new proof of the Erdős-Ko-Rado theorem for intersecting families of permutations, European J. The Erdos-Ko-Rado theorem gives a bound on the size of a family of intersecting This approach has been used to prove the standard Erdos-Ko- Rado theorem for sets An algebraic approach to the association schemes of coding theory. The definition of the centralizer algebra and Theorems A and B can be found in Wielandt . Keevash-Mubayi and others for the Erd˝os-Ko-Rado theorem. For example, in Erdos Ko Rado theory, besides direct combinatorial Theorem: Property (EKR) continues to hold for algebraic shifting. Algebraic Approaches to the Erdös-Ko-Rado. This approach was first pioneered by Simonovits  to answer a question Hilton and Milner  which proved a stability result for the Erdös-Ko-Rado theorem by giving Algebraic Discrete Methods 4 (1983), no. DELSARTE, An algebraic approach to the association schemes of coding theory, An extension of the Erdös, Ko, Rado theorem to t- designs. Journal of Algebraic Combinatorics A Homological Approach to Two Problems on Finite Sets extremal problem finite set Erdos-Ko-Rado Theorem. Intersecting families of permutations: An algebraic approach.