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

Research output: Contribution to journalArticlepeer-review

2 Scopus citations

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 languageEnglish
Pages (from-to)301-312
Number of pages12
JournalDiscrete Mathematics
Volume103
Issue number3
DOIs
StatePublished - 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.

Copyright:
Copyright 2018 Elsevier B.V., All rights reserved.

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

Fingerprint

Dive into the research topics of 'Rado's selection principle: applications to binary relations, graph and hypergraph colorings and partially ordered sets'. Together they form a unique fingerprint.

Cite this