default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid M. Evans 0001
Person information
- affiliation: Imperial College London, Department of Mathematics, London, UK
Other persons with the same name
- David M. Evans 0002
![[0000-0003-0663-4621]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0003-0663-4621")
— University of Queensland, Brisbane, Australia (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j15]Thomas D. H. Coleman, David M. Evans, Robert D. Gray:
Permutation monoids and MB-homogeneity for graphs and relational structures. Eur. J. Comb. 78: 163-189 (2019)- 2018
- [i3]David M. Evans, Jan Hubicka, Jaroslav Nesetril:
Automorphism groups and Ramsey properties of sparse graphs. CoRR abs/1801.01165 (2018) - [i2]David M. Evans, Jan Hubicka, Matej Konecný, Jaroslav Nesetril:
EPPA for two-graphs and antipodal metric spaces. CoRR abs/1812.11157 (2018) - 2017
- [i1]David M. Evans, Jan Hubicka, Jaroslav Nesetril:
Ramsey properties and extending partial automorphisms for classes of finite structures. CoRR abs/1705.02379 (2017) - 2016
- [j14]David M. Evans, Zaniar Ghadernezhad, Katrin Tent:
Simplicity of the automorphism groups of some Hrushovski constructions. Ann. Pure Appl. Log. 167(1): 22-48 (2016) - 2015
- [j13]Daniela A. Amato, David M. Evans:
Infinite primitive and distance transitive directed graphs of finite out-valency. J. Comb. Theory B 114: 33-50 (2015) - 2012
- [j12]Daniela A. Amato, David M. Evans, John Kenneth Truss:
Classification of some countable descendant-homogeneous digraphs. Discret. Math. 312(5): 911-919 (2012) - [j11]David M. Evans, Marco S. Ferreira:
The geometry of Hrushovski constructions, II. The strongly minimal case. J. Symb. Log. 77(1): 337-349 (2012) - 2011
- [j10]David M. Evans, Marco S. Ferreira:
The geometry of Hrushovski constructions, I: The uncollapsed case. Ann. Pure Appl. Log. 162(6): 474-488 (2011)
2000 – 2009
- 2009
- [j9]Josephine Emms, David M. Evans:
Constructing continuum many countable, primitive, unbalanced digraphs. Discret. Math. 309(13): 4475-4480 (2009) - 2003
- [j8]David M. Evans:
Ample dividing. J. Symb. Log. 68(4): 1385-1402 (2003) - 2002
- [j7]David M. Evans:
chi0- categorical structures with a predimension. Ann. Pure Appl. Log. 116(1-3): 157-186 (2002) - [j6]David M. Evans, M. E. Pantano:
Alef-Symbol 0 - Categorical Structures with Arbitrarily Fast Growth of Algebraic Closure. J. Symb. Log. 67(3): 897-909 (2002) - 2000
- [j5]David M. Evans, Frank O. Wagner:
Supersimple omega-Categorical Groups and Theories. J. Symb. Log. 65(2): 767-776 (2000)
1990 – 1999
- 1997
- [j4]David M. Evans:
Finite Covers with Finite Kernels. Ann. Pure Appl. Log. 88(2-3): 109-147 (1997) - [j3]David M. Evans:
An Infinite Highly Arc-transitive Digraph. Eur. J. Comb. 18(3): 281-286 (1997) - 1993
- [j2]David M. Evans, Ehud Hrushovski:
On the Automorphism Groups of Finite Covers. Ann. Pure Appl. Log. 62(2): 83-112 (1993) - 1990
- [j1]David M. Evans, P. R. Hewitt:
Counterexamples to a Conjecture on Relative Categoricity. Ann. Pure Appl. Log. 46(2): 201-209 (1990)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:01 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
