Rado's Selection Principle: Applications to binary relations, graph and hypergraph colorings and partially ordered sets (Q1195481)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Rado's Selection Principle: Applications to binary relations, graph and hypergraph colorings and partially ordered sets |
scientific article; zbMATH DE number 69893
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Rado's Selection Principle: Applications to binary relations, graph and hypergraph colorings and partially ordered sets |
scientific article; zbMATH DE number 69893 |
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
