An Erdős-Ko-Rado theorem for multisets (Q5903815): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0012-365x(88)90172-0 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2026757176 / rank | |||
Normal rank |
Latest revision as of 10:23, 30 July 2024
scientific article; zbMATH DE number 4079425
Language | Label | Description | Also known as |
---|---|---|---|
English | An Erdős-Ko-Rado theorem for multisets |
scientific article; zbMATH DE number 4079425 |
Statements
An Erdős-Ko-Rado theorem for multisets (English)
0 references
1988
0 references
Given integers \(k_ n\leq...\leq k_ 1\), the multiset \(M(k_ n,...,k_ 1)\) consists of the all vectors \(\vec x=(x_ n,...,x_ 1)\), where the \(x_ i\) are integers satisfying \(0\leq x_ i\leq k_ i\). The author gives two proofs of a refinement of Erdős-Ko-Rado Theorem stated by \textit{C. Greene} and \textit{D. J. Kleitman} [M.A.A. Stud. Math., Vol. 17, Studies in Combinatorics (1978; Zbl 0409.05012)]. \{The author shows by means of an example that the proof technique of Greene and Kleitman appears to be not quite correct.\}
0 references
Sperner's theorem
0 references
Erdős-Ko-Rado Theorem
0 references