More on the Erdős-Ko-Rado theorem for integer sequences
From MaRDI portal
Publication:793729
Recommendations
Cites work
- scientific article; zbMATH DE number 3461973 (Why is no real title available?)
- An analogue of the Erdoes-Ko-Rado theorem for the Hamming schemes H(n,q)
- An ordered version of the Erdős-Ko-Rado theorem
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Intersection theorems for systems of finite vector spaces
- On a combinatorial conjecture of Erdös
- The Erdös-Ko-Rado Theorem for Integer Sequences
Cited in
(11)- The Erdős-Ko-Rado theorem for integer sequences
- A Group-Theoretic Setting for Some Intersecting Sperner Families
- Some greedy \(t\)-intersecting families of finite sequences
- The Erdős-Ko-Rado properties of set systems defined by double partitions
- A generalization of Talbot's theorem about King Arthur and his knights of the round table
- Compression and Erdős-Ko-Rado graphs
- Erdős-Ko-Rado theorems for chordal graphs and trees
- Strongly intersecting integer partitions
- On Chvàtal's conjecture and a conjecture on families of signed sets
- Multiple cross-intersecting families of signed sets
- On \(t\)-intersecting families of signed sets and permutations
This page was built for publication: More on 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 Q793729)