Rado's Selection Principle: Applications to binary relations, graph and hypergraph colorings and partially ordered sets
DOI10.1016/0012-365X(92)90322-7zbMATH Open0776.05004OpenAlexW2076211087MaRDI QIDQ1195481FDOQ1195481
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
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
- Transversal theory. An account of some aspects of combinatorial mathematics
- Title not available (Why is that?)
- Infinite graphs—A survey
- Title not available (Why is that?)
- Coloring graphs with locally few colors
- The dichromatic number of a digraph
- Title not available (Why is that?)
- Title not available (Why is that?)
- Axiomatic Treatment of Rank in Infinite Sets
- Choice functions and Tychonoff’s theorem
- Title not available (Why is that?)
- Ramsey numbers for local colorings
- Local \(k\)-colorings of graphs and hypergraphs
- The Jump Number of Dags and Posets: An Introduction
- Title not available (Why is that?)
- Linear upper bounds for local Ramsey numbers
- Ein Endlichkeitssatz über die Dimension teilweise geordneter Mengen
- Title not available (Why is that?)
- Decomposition of Graphs Into Closed and Endless Chains
- A compactness theorem for perfect matchings in matroids
Cited In (2)
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)
