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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have