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.
|Number of pages||12|
|State||Published - May 28 1992|
Bibliographical noteFunding Information:
* Research supported in part by the ‘AKA’ Research Fund of the Hungarian Academy of Sciences and in part by University of Louisville.
Copyright 2018 Elsevier B.V., All rights reserved.
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics