Rado's Selection Principle: Applications to binary relations, graph and hypergraph colorings and partially ordered sets (Q1195481): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Zsolt Tuza / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Péter Komjáth / rank
Normal rank
 
Property / author
 
Property / author: Zsolt Tuza / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Péter Komjáth / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3941433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5808059 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Jump Number of Dags and Posets: An Introduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring graphs with locally few colors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3937430 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Choice functions and Tychonoff’s theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3903002 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramsey numbers for local colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local \(k\)-colorings of graphs and hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ein Endlichkeitssatz über die Dimension teilweise geordneter Mengen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3964626 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A compactness theorem for perfect matchings in matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5552096 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transversal theory. An account of some aspects of combinatorial mathematics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of Graphs Into Closed and Endless Chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite graphs—A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: The dichromatic number of a digraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Axiomatic Treatment of Rank in Infinite Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4101847 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear upper bounds for local Ramsey numbers / rank
 
Normal rank

Latest revision as of 14:40, 16 May 2024

scientific article
Language Label Description Also known as
English
Rado's Selection Principle: Applications to binary relations, graph and hypergraph colorings and partially ordered sets
scientific article

    Statements

    Rado's Selection Principle: Applications to binary relations, graph and hypergraph colorings and partially ordered sets (English)
    0 references
    0 references
    0 references
    6 December 1992
    0 references
    The authors give several combinatorial statements all trivially deducible from Rado's compactness principle.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Rado's selection principle
    0 references
    compactness argument
    0 references