### 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 | |

Publication status | Published - May 28 1992 |

### Fingerprint

### ASJC Scopus subject areas

- Discrete Mathematics and Combinatorics
- Theoretical Computer Science

### Cite this

**Rado's selection principle : applications to binary relations, graph and hypergraph colorings and partially ordered sets.** / Truszczynski, Miroslaw; Tuza, Z.

Research output: Contribution to journal › Article

*Discrete Mathematics*, vol. 103, no. 3, pp. 301-312. https://doi.org/10.1016/0012-365X(92)90322-7

}

TY - JOUR

T1 - Rado's selection principle

T2 - applications to binary relations, graph and hypergraph colorings and partially ordered sets

AU - Truszczynski, Miroslaw

AU - Tuza, Z.

PY - 1992/5/28

Y1 - 1992/5/28

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=37049000416&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=37049000416&partnerID=8YFLogxK

U2 - 10.1016/0012-365X(92)90322-7

DO - 10.1016/0012-365X(92)90322-7

M3 - Article

AN - SCOPUS:37049000416

VL - 103

SP - 301

EP - 312

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 3

ER -