Rado's Selection Principle: Applications to binary relations, graph and hypergraph colorings and partially ordered sets (Q1195481): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claims |
||
| Property / author | |||
| Property / author: Zsolt Tuza / rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Péter Komjáth / rank | |||
Revision as of 06:15, 10 February 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
