Rado's selection principle

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

Miroslaw Truszczynski, Z. Tuza

Research output: Contribution to journalArticle

2 Citations (Scopus)

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
Publication statusPublished - May 28 1992

Fingerprint

Jump number
Selection Principles
Binary relation
Partially Ordered Set
Coloring
Hypergraph
Colouring
Graph in graph theory
Compactness
If and only if
Subset
Formulation

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.

In: Discrete Mathematics, Vol. 103, No. 3, 28.05.1992, p. 301-312.

Research output: Contribution to journalArticle

@article{c52caedadb604b43b587593fb7302ece,
title = "Rado's selection principle: applications to binary relations, graph and hypergraph colorings and partially ordered sets",
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.",
author = "Miroslaw Truszczynski and Z. Tuza",
year = "1992",
month = "5",
day = "28",
doi = "10.1016/0012-365X(92)90322-7",
language = "English",
volume = "103",
pages = "301--312",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",
number = "3",

}

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

VL - 103

SP - 301

EP - 312

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 3

ER -