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

DOI10.1016/0097-3165(83)90013-4MaRDI QIDQ793729zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

integer sequencesmaximal systems of sequences

Mathematics Subject Classification ID

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

Review text

In der Arbeit wird die Anzahl solcher ganzen Folgen \((x_ 1,x_ 2,...,x_ n)\) untersucht, für die \(0\leq x_ i\leq k_ i\) und \(1\leq i\leq n\) ist, wobei zwei willkürliche Folgen mindestens in t Lagen übereinstimmen. Dabei sind n, \(1\leq k_ 1\leq k_ 2\leq,...,\leq k_ n,\) t ganze positive Zahlen. Besonders werden die Fälle \(k_ n=1\), \(t=1\) und \(t>1\) als auch \(k_ 1=k_ n\) analysiert und mit bekannten Ergebnissen verglichen. Es werden auch alle maximalen Folgensysteme beschrieben.

Recommendations

• The Erdős-Ko-Rado theorem for integer sequences
• Some inequalities concerning cross-intersecting families of integer sequences
• An Erdős-Ko-Rado theorem for integer sequences of given rank
• Integer sequences without singleton intersection
• An analogue of the Erdős-Ko-Rado theorem for weak compositions

Cites work

• 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
• scientific article; zbMATH DE number 3461973 (Why is no real title available?)
• 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)

• 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
• A Group-Theoretic Setting for Some Intersecting Sperner Families
• The Erdős-Ko-Rado theorem for integer sequences
• On Chvàtal's conjecture and a conjecture on families of signed sets
• Strongly intersecting integer partitions
• Multiple cross-intersecting families of signed sets

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)