default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEmil R. Vaughan
Person information
- affiliation: Queen Mary University of London, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j10]Victor Falgas-Ravry
, Oleg Pikhurko, Emil R. Vaughan, Jan Volec:
The codegree threshold of K4-. Electron. Notes Discret. Math. 61: 407-413 (2017)- [j9]Rahil Baber, Demetres Christofides, Ntah Ahn Dang, Emil R. Vaughan, Søren Riis:
Graph Guessing Games and Non-Shannon Information Inequalities. IEEE Trans. Inf. Theory 63(7): 4257-4267 (2017) - 2015
- [j8]Victor Falgas-Ravry, Edward Marchant, Oleg Pikhurko, Emil R. Vaughan:
The Codegree Threshold for 3-Graphs with Independent Neighborhoods. SIAM J. Discret. Math. 29(3): 1504-1539 (2015) - 2014
- [i1]Rahil Baber, Demetres Christofides, Ntah Ahn Dang, Søren Riis, Emil R. Vaughan:
Graph Guessing Games and non-Shannon Information Inequalities. CoRR abs/1410.8349 (2014) - 2013
- [j7]Victor Falgas-Ravry, Emil R. Vaughan:
Applications of the Semi-Definite Method to the Turán Density Problem for 3-Graphs. Comb. Probab. Comput. 22(1): 21-54 (2013) - [j6]Oleg Pikhurko, Emil R. Vaughan:
Minimum Number of k-Cliques in Graphs with Bounded Independence Number. Comb. Probab. Comput. 22(6): 910-934 (2013) - [j5]Emil R. Vaughan:
An Asymptotic Version of the Multigraph 1-Factorization Conjecture. J. Graph Theory 72(1): 19-29 (2013) - [c1]Rahil Baber, Demetres Christofides, Ntah Ahn Dang, Søren Riis, Emil R. Vaughan:
Multiple unicasts, graph guessing games, and non-Shannon inequalities. NetCod 2013: 1-6 - 2012
- [j4]Victor Falgas-Ravry, Emil R. Vaughan:
Turán H-Densities for 3-Graphs. Electron. J. Comb. 19(3): 40 (2012) - 2011
- [j3]Donald A. Preece, Emil R. Vaughan:
Daisy chains with four generators. Australas. J Comb. 49: 77-94 (2011) - [j2]Ermelinda DeLaViña, Wayne Goddard, Michael A. Henning, Ryan Pepper, Emil R. Vaughan:
Bounds on the k-domination number of a graph. Appl. Math. Lett. 24(6): 996-998 (2011)
2000 – 2009
- 2009
- [j1]Emil R. Vaughan:
The Complexity of Constructing Gerechte Designs. Electron. J. Comb. 16(1) (2009)
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 2024-04-24 23:07 CEST 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:
