More on the Erdős-Ko-Rado theorem for integer sequences
From MaRDI portal
Publication:793729
DOI10.1016/0097-3165(83)90013-4zbMath0539.05003MaRDI QIDQ793729
Publication date: 1983
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(83)90013-4
05A15: Exact enumeration problems, generating functions
05A05: Permutations, words, matrices
03E05: Other combinatorial set theory
Related Items
A Group-Theoretic Setting for Some Intersecting Sperner Families, On Chvàtal's conjecture and a conjecture on families of signed sets, Strongly intersecting integer partitions, Multiple cross-intersecting families of signed sets, A generalization of Talbot's theorem about King Arthur and his knights of the round table, On \(t\)-intersecting families of signed sets and permutations, The Erdős-Ko-Rado properties of set systems defined by double partitions, Some greedy \(t\)-intersecting families of finite sequences, Compression and Erdős-Ko-Rado graphs, Erdős-Ko-Rado theorems for chordal graphs and trees
Cites Work
- Unnamed Item
- An ordered version of the Erdős-Ko-Rado theorem
- An analogue of the Erdoes-Ko-Rado theorem for the Hamming schemes H(n,q)
- Intersection theorems for systems of finite vector spaces
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- The Erdös-Ko-Rado Theorem for Integer Sequences
- On a combinatorial conjecture of Erdös
