Automorphism groups of countable algebraically closed graphs and endomorphisms of the random graph

2016 
We establish links between countable algebraically closed graphs and the endomorphisms of the countable universal graph R. As a consequence we show that, for any countable graph , there are uncountably many maximal subgroups of the en domorphism monoid of R isomorphic to the automorphism group of . Further structural in formation about EndR is
    • Correction
    • Source
    • Cite
    • Save
    • Machine Reading By IdeaReader
    20
    References
    5
    Citations
    NaN
    KQI
    []