More on the Erdős-Ko-Rado theorem for integer sequences (Q793729): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4047583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Erdös-Ko-Rado Theorem for Integer Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection theorems for systems of finite vector spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a combinatorial conjecture of Erdös / rank
 
Normal rank
Property / cites work
 
Property / cites work: An ordered version of the Erdős-Ko-Rado theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analogue of the Erdoes-Ko-Rado theorem for the Hamming schemes H(n,q) / rank
 
Normal rank

Latest revision as of 12:53, 14 June 2024

scientific article
Language Label Description Also known as
English
More on the Erdős-Ko-Rado theorem for integer sequences
scientific article

    Statements

    More on the Erdős-Ko-Rado theorem for integer sequences (English)
    0 references
    1983
    0 references
    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.
    0 references
    0 references
    0 references
    0 references
    0 references
    integer sequences
    0 references
    maximal systems of sequences
    0 references
    0 references
    0 references