Rado's Selection Principle: Applications to binary relations, graph and hypergraph colorings and partially ordered sets

DOI10.1016/0012-365X(92)90322-7MaRDI QIDQ1195481zbMATH OpenOpenAlexFDO

Authors Mirosław Truszczyński, Zsolt Tuza

Publication date 6 December 1992

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(92)90322-7

zbMATH Keywords

compactness argumentRado's selection principle

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65) Combinatorics of partially ordered sets (06A07) Axiom of choice and related propositions (03E25) Other classical set theory (including functions, relations, and set algebra) (03E20)

Cites work

• scientific article; zbMATH DE number 3711961 (Why is no real title available?)
• scientific article; zbMATH DE number 3754727 (Why is no real title available?)
• scientific article; zbMATH DE number 3758364 (Why is no real title available?)
• scientific article; zbMATH DE number 3786844 (Why is no real title available?)
• scientific article; zbMATH DE number 3523586 (Why is no real title available?)
• scientific article; zbMATH DE number 3265667 (Why is no real title available?)
• scientific article; zbMATH DE number 3068973 (Why is no real title available?)
• A compactness theorem for perfect matchings in matroids
• Axiomatic Treatment of Rank in Infinite Sets
• Choice functions and Tychonoff’s theorem
• Coloring graphs with locally few colors
• Decomposition of Graphs Into Closed and Endless Chains
• Ein Endlichkeitssatz über die Dimension teilweise geordneter Mengen
• Infinite graphs—A survey
• Linear upper bounds for local Ramsey numbers
• Local k-colorings of graphs and hypergraphs
• Ramsey numbers for local colorings
• The Jump Number of Dags and Posets: An Introduction
• The dichromatic number of a digraph
• Transversal theory. An account of some aspects of combinatorial mathematics

Cited in

(2)

• Circular coloring of graphs via linear programming and tabu search
• On point covers of parallel rectangles

This page was built for publication: Rado's Selection Principle: Applications to binary relations, graph and hypergraph colorings and partially ordered sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1195481)