The poset of all copies of the random graph has the 2-localization property (Q286593): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The random graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymmetric graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4354789 / rank
 
Normal rank
Property / cites work
 
Property / cites work: FROM A1 TO D5: TOWARDS A FORCING-RELATED CLASSIFICATION OF RELATIONAL STRUCTURES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Posets of copies of countable scattered linear orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forcing with copies of countable ordinals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isomorphic and strongly connected components / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximally embeddable components / rank
 
Normal rank
Property / cites work
 
Property / cites work: Different similarities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forcing by non-scattered sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The poset of all copies of the random graph has the 2-localization property / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Ideal Determined by the Unsymmetric Game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal graphs and universal functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>n</i>–localization property / rank
 
Normal rank

Latest revision as of 01:27, 12 July 2024

scientific article
Language Label Description Also known as
English
The poset of all copies of the random graph has the 2-localization property
scientific article

    Statements

    The poset of all copies of the random graph has the 2-localization property (English)
    0 references
    0 references
    0 references
    20 May 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    countable random graph
    0 references
    isomorphic substructure
    0 references
    self-embedding
    0 references
    right Green's pre-order
    0 references
    2-localization
    0 references
    forcing
    0 references
    0 references
    0 references