5 citations · 5 across the 3 of their papers we have counts for
1 paper · 1 filter
Miloš S. Kurilić, Stevo Todorčević
Let G be a countable graph containing a copy of the countable random graph (Erdős-Rényi graph, Rado graph), Emb(G) the monoid of its self-embeddings, ${\mathbb P} (G)=\{f[G]:…