An Erdős-Ko-Rado theorem for integer sequences of given rank
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3621717 (Why is no real title available?)
- scientific article; zbMATH DE number 3636041 (Why is no real title available?)
- scientific article; zbMATH DE number 3327849 (Why is no real title available?)
- scientific article; zbMATH DE number 3351583 (Why is no real title available?)
- An Erdős-Ko-Rado theorem for the subcubes of a cube
- An analogue of the Erdoes-Ko-Rado theorem for the Hamming schemes H(n,q)
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Intersecting Sperner families and their convex hulls
- Intersection theorems for systems of finite sets
- Intersection theorems for systems of finite vector spaces
- The Erdös-Ko-Rado Theorem for Integer Sequences
- The exact bound in the Erdős-Ko-Rado theorem
Cited in
(11)- More on the Erdős-Ko-Rado theorem for integer sequences
- An intersection-union theorem for integer sequences
- The \(t\)-intersection problem in the truncated Boolean lattice
- The Erdős-Ko-Rado theorem for integer sequences
- Some greedy \(t\)-intersecting families of finite sequences
- A generalization of Talbot's theorem about King Arthur and his knights of the round table
- Compression and Erdős-Ko-Rado graphs
- The Erdős-Ko-Rado theorem for 2-pointwise and 2-setwise intersecting permutations
- scientific article; zbMATH DE number 3526750 (Why is no real title available?)
- scientific article; zbMATH DE number 1092064 (Why is no real title available?)
- Multiple cross-intersecting families of signed sets
This page was built for publication: An Erdős-Ko-Rado theorem for integer sequences of given rank
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1096631)