Finite union theorem with restrictions (Q1106223): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3907600 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Ramsey property for graphs with forbidden complete subgraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4113906 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Another proof of the Folkman-Rado-Sanders theorem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Studien zur Kombinatorik / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Restricted Ramsey configurations / rank | |||
Normal rank |
Revision as of 17:14, 18 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Finite union theorem with restrictions |
scientific article |
Statements
Finite union theorem with restrictions (English)
0 references
1986
0 references
The aim of this paper is to prove the following extension of the Folkman- Rado-Sanders Finite Union Theorem: For every positive integers r and k there exists a family \({\mathcal S}\) of sets having the following properties: i) if \(S_ 1,S_ 2,...,S_{k+1}\) are distinct pairwise disjoint elements of \({\mathcal S}\) then there exists nonempty \(I\subset \{1,2,...,k+1\}\) with \(\cup_{i\in I}S_ i\equiv {\mathcal S},\) ii) if \({\mathcal S}={\mathcal S}_ 1\cup...\cup {\mathcal S}_ r\) is an arbitrary partition then there exists \(j\leq r\) and pairwise disjoint sets \(S_ 1,S_ 2,...,S_ k\in {\mathcal S}_ j\), such that \(\cup_{i\in I}S_ i\in {\mathcal S}_ j\) for every nonempty \(I\subset \{1,2,...,k\}\).
0 references
Folkman-Rado-Sanders Finite Union Theorem
0 references