The poset of all copies of the random graph has the 2-localization property (Q286593)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The poset of all copies of the random graph has the 2-localization property |
scientific article; zbMATH DE number 6583452
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The poset of all copies of the random graph has the 2-localization property |
scientific article; zbMATH DE number 6583452 |
Statements
The poset of all copies of the random graph has the 2-localization property (English)
0 references
20 May 2016
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.8153463006019592
0 references
0.7459568381309509
0 references
0.7459568381309509
0 references
0.7408340573310852
0 references
0.7408340573310852
0 references
