Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 301-312 |
| Number of pages | 12 |
| Journal | Discrete Mathematics |
| Volume | 103 |
| Issue number | 3 |
| DOIs | |
| State | Published - May 28 1992 |
Bibliographical note
Funding Information:* Research supported in part by the ‘AKA’ Research Fund of the Hungarian Academy of Sciences and in part by University of Louisville.
Funding
* Research supported in part by the ‘AKA’ Research Fund of the Hungarian Academy of Sciences and in part by University of Louisville.
| Funders |
|---|
| University of Kentucky, University of Louisville |
| Magyar Tudományos Akadémia |
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics