A discrete isodiametric result: The Erdős–Ko–Rado theorem for multisets. (August 2015)

• Record Type: Journal Article
• Authors: Füredi, Zoltán; Gerbner, Dániel; Vizer, Máté
• Is Part Of: European journal of combinatorics. Volume 48(2015:Aug.)
• Page Start: 224
• Page End: 233
• Publication Date: 2015-08
• Subjects: Combinatorial analysis -- Periodicals; Analyse combinatoire -- Périodiques; Combinatorial analysis; Periodicals; Electronic journals; 511.6
• DOI: 10.1016/j.ejc.2015.02.023
• Languages: English
• ISSNs: 0195-6698

Abstract

Abstract: There are many generalizations of the Erdős–Ko–Rado theorem. Here the new results (and problems) concern families of t -intersecting k -element multisets of an n -set. We point out connections to coding theory and geometry. We verify the conjecture that for n ≥ t ( k − t ) + 2 such a family can have at most ( n + k − t − 1 k − t ) members.