Partitioning a power set into union-free classes (Q1176718): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A problem of Schur and its generalizations / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Hook-free colorings and a problem of Hanson / 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: Q5661505 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On a Combinatorial Problem of Erdos / rank | |||
Normal rank | |||
Latest revision as of 10:58, 15 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Partitioning a power set into union-free classes |
scientific article |
Statements
Partitioning a power set into union-free classes (English)
0 references
25 June 1992
0 references
partitioning a power set
0 references
union-free colorings
0 references
bounds
0 references
minimum colorings
0 references
