The Erdös-Ko-Rado Theorem for Integer Sequences
From MaRDI portal
Publication:4742786
DOI10.1137/0601044zbMATH Open0506.05001OpenAlexW2095111771MaRDI QIDQ4742786FDOQ4742786
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
Permutations, words, matrices (05A05) Factorials, binomial coefficients, combinatorial functions (05A10) Sequences and sets (11B99)
Cites Work
Cited In (31)
- Pseudo-LYM inequalities and AZ identities
- Forbidden intersections for codes
- Codes with given distances
- Probabilities for Intersecting Systems and Random Subsets of Finite Sets
- Compression and Erdős-Ko-Rado graphs
- An Erdős-Ko-Rado theorem for integer sequences of given rank
- Cross-intersecting families of vectors
- An exact result for \((0, \pm 1)\)-vectors
- Cross-Intersecting Families of Vectors
- Fundamentals of coding type problems
- Non-trivial \(t\)-intersecting separated families
- Multiple cross-intersecting families of signed sets
- On \(t\)-intersecting families of signed sets and permutations
- An analogue of the Erdoes-Ko-Rado theorem for the Hamming schemes H(n,q)
- The Katona cycle proof of the Erdős-Ko-Rado theorem and its possibilities
- Erdös–Ko–Rado Theorem—22 Years Later
- Some Erdős-Ko-Rado theorems for injections
- More on the Erdős-Ko-Rado theorem for integer sequences
- On Intersecting Chains in Boolean Algebras
- An intersection problem for codes
- Cross \(t\)-intersecting integer sequences from weighted Erdős-Ko-Rado
- An Erdős-Ko-Rado theorem for cross \(t\)-intersecting families
- Some inequalities concerning cross-intersecting families of integer sequences
- Integer sequences without singleton intersection
- Intersection theorems for t-valued functions
- Diametric theorems in sequence spaces
- On subsets of the hypercube with prescribed Hamming distances
- A sharp bound for the product of weights of cross-intersecting families
- Vector sum-intersection theorems
- Strongly intersecting integer partitions
- Extremal problems concerning ordered intersections of sets
This page was built for publication: The Erdös-Ko-Rado Theorem for Integer Sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4742786)