default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRobert Hancock 0002
Person information
- affiliation: University of Oxford, Mathematical Institute, United Kingdom
- affiliation: University of Birmingham, School of Mathematics, United Kingdom
Other persons with the same name
- Robert Hancock — disambiguation page
- Robert Hancock 0001 — Southeastern Louisiana University, Hammond
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j13]Natalie C. Behague, Robert Hancock, Joseph Hyde, Shoham Letzter, Natasha Morrison:
Thresholds for constrained Ramsey and anti-Ramsey problems. Eur. J. Comb. 129: 104159 (2025)- [j12]António Girão, Robert Hancock
:
Immersions of Directed Graphs in Tournaments. Random Struct. Algorithms 66(1) (2025) - 2024
- [j11]António Girão, Robert Hancock:
Two Ramsey problems in blowups of graphs. Eur. J. Comb. 120: 103984 (2024) - 2023
- [j10]Robert Hancock, Adam Kabela, Daniel Král', Taísa Martins, Roberto Parente, Fiona Skerman, Jan Volec:
No additional tournaments are quasirandom-forcing. Eur. J. Comb. 108: 103632 (2023) - [j9]Victor Falgas-Ravry, Robert Hancock, Johanna Strömberg, Andrew J. Uzzell:
Rectilinear approximation and volume estimates for hereditary bodies via [0, 1]-decorated containers. J. Graph Theory 104(1): 104-132 (2023) - [j8]Robert Hancock, Daniel Král', Matjaz Krnc, Jan Volec:
Toward characterizing locally common graphs. Random Struct. Algorithms 62(1): 181-218 (2023) - 2022
- [j7]Robert Hancock, Andrew Treglown:
An asymmetric random Rado theorem for single equations: The 0-statement. Random Struct. Algorithms 60(4): 529-550 (2022) - 2021
- [j6]Pablo Candela, Carlos Catalá, Robert Hancock, Adam Kabela, Daniel Král', Ander Lamaison, Lluís Vena:
Coloring graphs by translates in the circle. Eur. J. Comb. 96: 103346 (2021) - 2020
- [j5]A. Nicholas Day, Victor Falgas-Ravry, Robert Hancock:
Long paths and connectivity in 1-independent random graphs. Random Struct. Algorithms 57(4): 1007-1049 (2020)
2010 – 2019
- 2019
- [j4]Robert Hancock:
The Maker-Breaker Rado Game on a Random Set of Integers. SIAM J. Discret. Math. 33(1): 68-94 (2019) - [j3]Robert Hancock, Katherine Staden, Andrew Treglown:
Independent Sets in Hypergraphs and Ramsey Properties of Graphs and the Integers. SIAM J. Discret. Math. 33(1): 153-188 (2019) - [i1]Robert Hancock, Adam Kabela, Daniel Král, Taísa L. Martins, Roberto Parente, Fiona Skerman, Jan Volec:
No additional tournaments are quasirandom-forcing. CoRR abs/1912.04243 (2019) - 2017
- [j2]Robert Hancock, Andrew Treglown:
On solution-free sets of integers. Eur. J. Comb. 66: 110-128 (2017) - 2016
- [j1]Robert Hancock, Andrew Treglown:
Enumerating solution-free sets in the integers. Electron. Notes Discret. Math. 56: 21-30 (2016)
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-09-27 03:47 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:
