✦ LIBER ✦

Rado's selection principle: applications to binary relations, graph and hypergraph colorings and partially ordered sets

✍ Scribed by Miroslaw Truszczynski; Zsolt Tuza

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 917 KB
Volume: 103
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(92)90322-7

No coin nor oath required. For personal study only.

✦ Synopsis

Three formulations and various consequences of a compactness principle are given. For example it is shown that an infinite partially ordered set has the jump number at most k if and only if none of its finite subsets has the jump number greater than k. Other applications include Ramsey-type results on local colorings of hypergraphs.