Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/31347
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Dolinka Igor | - |
dc.contributor.author | Gray Robert D. | - |
dc.contributor.author | McPhee Jillian D. | - |
dc.contributor.author | Mitchell James D. | - |
dc.contributor.author | Quick Martyn | - |
dc.date.accessioned | 2020-12-14T19:51:54Z | - |
dc.date.available | 2020-12-14T19:51:54Z | - |
dc.date.issued | 2016 | - |
dc.identifier.issn | 0305-0041 | - |
dc.identifier.uri | https://open.uns.ac.rs/handle/123456789/31347 | - |
dc.description.abstract | Copyright © Cambridge Philosophical Society 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 endomorphism monoid of R isomorphic to the automorphism group of Γ. Further structural information about End R is established including that Aut Γ arises in uncountably many ways as a Schützenberger group. Similar results are proved for the countable universal directed graph and the countable universal bipartite graph. | - |
dc.language.iso | en | - |
dc.relation.ispartof | Mathematical Proceedings of the Cambridge Philosophical Society | - |
dc.source | CRIS UNS | - |
dc.source.uri | http://cris.uns.ac.rs | - |
dc.title | Automorphism groups of countable algebraically closed graphs and endomorphisms of the random graph | - |
dc.type | Journal/Magazine Article | - |
dc.identifier.doi | 10.1017/S030500411500078X | - |
dc.identifier.scopus | 2-s2.0-84955253873 | - |
dc.identifier.url | https://www.cris.uns.ac.rs/record.jsf?recordId=96951&source=BEOPEN&language=en | - |
dc.identifier.url | https://api.elsevier.com/content/abstract/scopus_id/84955253873 | - |
dc.relation.lastpage | 462 | - |
dc.relation.firstpage | 437 | - |
dc.relation.issue | 3 | - |
dc.relation.volume | 160 | - |
dc.identifier.externalcrisreference | (BISIS)96951 | - |
item.grantfulltext | none | - |
item.fulltext | No Fulltext | - |
crisitem.author.dept | Prirodno-matematički fakultet, Departman za matematiku i informatiku | - |
crisitem.author.orcid | 0000-0002-8644-0626 | - |
crisitem.author.parentorg | Prirodno-matematički fakultet | - |
Appears in Collections: | PMF Publikacije/Publications |
SCOPUSTM
Citations
2
checked on May 6, 2023
Page view(s)
23
Last Week
4
4
Last month
0
0
checked on May 10, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.