More on the Erdős-Ko-Rado theorem for integer sequences

DOI10.1016/0097-3165(83)90013-4zbMath0539.05003OpenAlexW2013133169MaRDI QIDQ793729

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

zbMATH Keywords

integer sequencesmaximal systems of sequences

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05) Other combinatorial set theory (03E05)

Related Items (10)

Some greedy \(t\)-intersecting families of finite sequences ⋮ A Group-Theoretic Setting for Some Intersecting Sperner Families ⋮ On Chvàtal's conjecture and a conjecture on families of signed sets ⋮ Erdős-Ko-Rado theorems for chordal graphs and trees ⋮ Multiple cross-intersecting families of signed sets ⋮ Compression and Erdős-Ko-Rado graphs ⋮ Strongly intersecting integer partitions ⋮ 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

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

This page was built for publication: More on the Erdős-Ko-Rado theorem for integer sequences