Rado's Selection Principle: Applications to binary relations, graph and hypergraph colorings and partially ordered sets (Q1195481): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 03:30, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Rado's Selection Principle: Applications to binary relations, graph and hypergraph colorings and partially ordered sets |
scientific article |
Statements
Rado's Selection Principle: Applications to binary relations, graph and hypergraph colorings and partially ordered sets (English)
0 references
6 December 1992
0 references
The authors give several combinatorial statements all trivially deducible from Rado's compactness principle.
0 references
Rado's selection principle
0 references
compactness argument
0 references