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

DOI10.1016/0012-365X(92)90322-7zbMath0776.05004OpenAlexW2076211087MaRDI QIDQ1195481

Miroslaw Truszczynski, 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

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

Related Items (2)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Coloring graphs with locally few colors
• Linear upper bounds for local Ramsey numbers
• Ramsey numbers for local colorings
• Local \(k\)-colorings of graphs and hypergraphs
• A compactness theorem for perfect matchings in matroids
• The dichromatic number of a digraph
• Transversal theory. An account of some aspects of combinatorial mathematics
• Decomposition of Graphs Into Closed and Endless Chains
• The Jump Number of Dags and Posets: An Introduction
• Infinite graphs—A survey
• Ein Endlichkeitssatz über die Dimension teilweise geordneter Mengen
• Axiomatic Treatment of Rank in Infinite Sets
• Choice functions and Tychonoff’s theorem

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