More on the Erdős-Ko-Rado theorem for integer sequences
From MaRDI portal
Publication:793729
DOI10.1016/0097-3165(83)90013-4zbMATH Open0539.05003OpenAlexW2013133169MaRDI QIDQ793729FDOQ793729
Authors: Hans-Dietrich O. F. Gronau 
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
Recommendations
Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Other combinatorial set theory (03E05)
Cites Work
- Intersection theorems for systems of finite vector spaces
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- An analogue of the Erdoes-Ko-Rado theorem for the Hamming schemes H(n,q)
- Title not available (Why is that?)
- The Erdös-Ko-Rado Theorem for Integer Sequences
- On a combinatorial conjecture of Erdös
- An ordered version of the Erdős-Ko-Rado theorem
Cited In (11)
- The Erdős-Ko-Rado properties of set systems defined by double partitions
- Compression and Erdős-Ko-Rado graphs
- Erdős-Ko-Rado theorems for chordal graphs and trees
- On Chvàtal's conjecture and a conjecture on families of signed sets
- A Group-Theoretic Setting for Some Intersecting Sperner Families
- Multiple cross-intersecting families of signed sets
- On \(t\)-intersecting families of signed sets and permutations
- The Erdős-Ko-Rado theorem for integer sequences
- Strongly intersecting integer partitions
- Some greedy \(t\)-intersecting families of finite sequences
- A generalization of Talbot's theorem about King Arthur and his knights of the round table
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)
