Robert Hancock
I am a postdoctoral researcher at Heidelberg University, where I am a member of the Theoretical Computer Science group headed by Felix Joos. My position is sponsored by a Humboldt research fellowship. My research interests lie in extremal graph theory and additive combinatorics.
From January 2019-September 2020 I was at Masaryk University in Brno, working with Dan Kráľ. From July-December 2018 I was at the Czech Academy of Sciences, working with Jan Hladký. Before that I was a PhD student at the University of Birmingham under the supervision of Andrew Treglown, defending my thesis in October 2018. For the final semester of my PhD studies I visited Victor Falgas-Ravry at Umeå University as an Erasmus exchange student. Between 2010 and 2014 I completed an MMath at the University of St Andrews. Here is a copy of my CV.
Profiles: Arxiv Orcid GoogleScholar
Contact Details
Address: Institut für Informatik, Im Neuenheimer Feld 205, 69120 Heidelberg
Email: hancock -at- informatik.uni-heidelberg.de
Office: 2/212
Preprints and publications
Preprints:
Rectilinear approximation and volume estimates for hereditary bodies via [0,1]-decorated containers (with Victor Falgas-Ravry, Johanna Strömberg and Andrew Uzzell)
Limits of Latin squares (with Frederik Garbe, Jan Hladký and Maryam Sharifzadeh)
No additional tournaments are quasirandom-forcing (with Adam Kabela, Daniel Král', Taísa Martins, Roberto Parente, Fiona Skerman and Jan Volec)
Papers:
Towards characterizing locally common graphs (with Daniel Král', Matjaž Krnc and Jan Volec, to appear in Random Structures & Algorithms)
An asymmetric random Rado theorem for single equations: the 0-statement (with Andrew Treglown, Random Structures & Algorithms, 60 (2022), 529-550)
Coloring graphs by translates in the circle (with Pablo Candela, Carlos Catalá, Adam Kabela, Daniel Král', Ander Lamaison and Lluís Vena, European Journal of Combinatorics, 96 (2021), article no. 103346, 18pp.)
Long paths and connectivity in 1-independent random graphs (with A. Nicholas Day and Victor Falgas-Ravry, Random Structures & Algorithms, 57 (2020), 1007-1049)
Independent sets in hypergraphs and Ramsey properties of graphs and the integers (with Katherine Staden and Andrew Treglown, SIAM Journal on Discrete Mathematics, 33 (2019), 153-188)
The Maker-Breaker Rado game on a random set of integers (SIAM Journal on Discrete Mathematics, 33 (2019), 68-94)
On solution-free sets of integers II (with Andrew Treglown, Acta Arithmetica, 180 (2017), 15-33)
On solution-free sets of integers (with Andrew Treglown, European Journal of Combinatorics, 66 (2017), 110-128)
Conference Papers:
Theory of limits of sequences of Latin squares (with Frederik Garbe, Jan Hladký and Maryam Sharifzadeh, Acta Mathematica Universitatis Comenianae, 88 (2019), 709-716)
Enumerating solution-free sets in the integers (with Andrew Treglown, Electronic Notes in Discrete Mathematics, 56 (2016), 21-30)
Conferences, Workshops and Seminars
Talks:
28th British Combinatorial Conference, Durham University, 5th-9th July 2021
Graph Theory seminar, UWB Pilsen, 10th December 2019
Joint DIMEA and FORMELA seminar, Masaryk University, 18th November 2019
27th British Combinatorial Conference, University of Birmingham, 29th July-2nd August 2019
The 19th International Conference on Random Structures and Algorithms, ETH Zurich, 15th-19th July 2019
CanaDAM 2019, Simon Fraser University, Vancouver, 28th-31st May 2019
Combinatorics Seminar, University of Warwick, 27th November 2018
Combinatorics Seminar, Czech Academy of Sciences, Prague, 23rd November 2018
Discrete Mathematics Seminar, Umeå University, 24th January 2018
DIMAP Seminar, University of Warwick, 9th January 2018
Extremal Combinatorics, University of Warwick, 18th-22nd September 2017
The 18th International Conference on Random Structures and Algorithms, Gniezno, 7th-11th August 2017
26th British Combinatorial Conference, University of Strathclyde, 3rd-7th July 2017
Barcelona Combinatorics Seminar, 6th June 2017
Scottish Combinatorics Meeting 2017, University of St Andrews, 24th-25th April 2017
SIAM Discrete Mathematics, Georgia State University, Atlanta, Georgia, USA, 6th-10th June 2016
Scottish Combinatorics Meeting 2016, University of Glasgow, 26th-27th April 2016
1st IMA Conference on Theoretical and Computational Discrete Mathematics, University of Derby, 22nd-23rd March 2016
Birmingham Combinatorics Seminar, 18th January 2016
Posters:
LMS-EMS Mathematical Weekend, University of Birmingham, September 18th-20th, 2015 (award for best postgraduate poster)
Teaching
Heidelberg University: (2020-present)
Lecturer: Discrete Structures I (Winter 2021)
Seminar Leader: Combinatorial Optimization (Summer 2021)
Seminar Leader: Algorithms for computationally hard problems (Winter 2020)
Masaryk University: Tutorial Group Leader (2019)
MA010 Graph Theory.
University of Birmingham: Postgraduate Teaching Assistant (2014-2017):
Numerical Programming (Spring 2017)
Multivariate Analysis (Spring 2016, Spring 2017, Autumn 2017)
Communication Theory and Combinatorics (Autumn 2015, Autumn 2017)
Algebra & Combinatorics 2 (Autumn 2015)
Linear Algebra (Autumn 2014)
Number Theory (Autumn 2014)
1st year support class and computer lab demonstrating (Autumn 2014, Spring 2015, Autumn 2015, Spring 2016, Autumn 2016, Autumn 2017)