Shelah's revised GCH theorem and a question by Alon on infinite graphs colorings (Q466092): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3142409 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4500691 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On chromatic number of graphs and set-systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: NO BOUND FOR THE FIRST FIXED POINT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Splitting Strongly Almost Disjoint Families / rank
 
Normal rank
Property / cites work
 
Property / cites work: The list-chromatic number of infinite graphs defined on Euclidean spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: The list-chromatic number of infinite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4326402 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The generalized continuum hypothesis revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: More on the revised GCH and the black box / rank
 
Normal rank

Latest revision as of 05:48, 9 July 2024

scientific article
Language Label Description Also known as
English
Shelah's revised GCH theorem and a question by Alon on infinite graphs colorings
scientific article

    Statements

    Shelah's revised GCH theorem and a question by Alon on infinite graphs colorings (English)
    0 references
    0 references
    24 October 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    list-chromatic number, coloring number
    0 references
    0 references
    0 references