The Erdös-Ko-Rado Theorem for Integer Sequences

DOI10.1137/0601044zbMath0506.05001OpenAlexW2095111771MaRDI QIDQ4742786

Peter Frankl, Zoltan Fueredi

Publication date: 1980

Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0601044

zbMATH Keywords

integer sequencessubsets

Mathematics Subject Classification ID

Factorials, binomial coefficients, combinatorial functions (05A10) Permutations, words, matrices (05A05) Sequences and sets (11B99)

Related Items (30)

Probabilities for Intersecting Systems and Random Subsets of Finite Sets ⋮ The Katona cycle proof of the Erdős-Ko-Rado theorem and its possibilities ⋮ Codes with given distances ⋮ An Erdős-Ko-Rado theorem for integer sequences of given rank ⋮ On Intersecting Chains in Boolean Algebras ⋮ Pseudo-LYM inequalities and AZ identities ⋮ Cross-Intersecting Families of Vectors ⋮ Some inequalities concerning cross-intersecting families of integer sequences ⋮ Integer sequences without singleton intersection ⋮ Forbidden intersections for codes ⋮ Vector sum-intersection theorems ⋮ Non-trivial \(t\)-intersecting separated families ⋮ An analogue of the Erdoes-Ko-Rado theorem for the Hamming schemes H(n,q) ⋮ Intersection theorems for t-valued functions ⋮ An Erdős-Ko-Rado theorem for cross \(t\)-intersecting families ⋮ An intersection problem for codes ⋮ A sharp bound for the product of weights of cross-intersecting families ⋮ Diametric theorems in sequence spaces ⋮ Multiple cross-intersecting families of signed sets ⋮ Some Erdős-Ko-Rado theorems for injections ⋮ Erdös–Ko–Rado Theorem—22 Years Later ⋮ Compression and Erdős-Ko-Rado graphs ⋮ An exact result for \((0, \pm 1)\)-vectors ⋮ Strongly intersecting integer partitions ⋮ On subsets of the hypercube with prescribed Hamming distances ⋮ Fundamentals of coding type problems ⋮ On \(t\)-intersecting families of signed sets and permutations ⋮ Cross t-Intersecting Integer Sequences from Weighted Erdős–Ko–Rado ⋮ More on the Erdős-Ko-Rado theorem for integer sequences ⋮ Cross-intersecting families of vectors

Cites Work

• Unnamed Item
• Unnamed Item
• An ordered version of the Erdős-Ko-Rado theorem
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Families of finite sets satisfying an intersection condition
• Families of Non-disjoint subsets
• On a combinatorial conjecture of Erdös

This page was built for publication: The Erdös-Ko-Rado Theorem for Integer Sequences