Jake Horsfield
Supervised by Kristina Vušković
Expecting to graduate in 2022
[email]
Papers

Graphs with all holes the same length
with L. Cook, M. Preissmann, C. Robin, P. Seymour, N. L. D. Sintiari, N. Trotignon and K. Vušković
submitted to Journal of Combinatorial Theory, Series B 
List \(k\)colouring
\(P_t\)free graphs: a mimwidth perspective
with N. Brettell and D. Paulusma
Information Processing Letters (2022) 
Bounding the mimwidth of hereditary graph classes
with N. Brettell, A. Munaro, G. Paesani and D. Paulusma
Journal of Graph Theory (2021) 
Two classes of \(\beta\)perfect graphs that do not necessarily have simplicial extremes
with K. Vušković
Discrete Mathematics (2021)
Teaching
 2021: TA for Algorithms & Data Structures 1 (Level 2) and Fundamental Mathematical Concepts (Level 1)
 2020: TA for Graph Theory: Structure and Algorithms (Masters level)
 2020: TA for Introduction to Discrete Mathematics (Level 1)
 2019: TA for Algorithms & Data Structures 1 (Level 2)
 2019: TA for Introduction to Discrete Mathematics (Level 1)
Talks
 Algorithms and Complexity Seminar 03/2021 (Leeds) Variations on 2joins [slides to appear]
 ACiD Seminar 02/2020 (Durham) \(\beta\)perfect graphs that do not necessarily have simplicial extremes [slides]
 Workshop on evenholefree graphs 04/2019 (Belgrade) \(\beta\)perfect graphs [slides]
Conferences / workshops / etc.
 Research visit to Durham University, hosted by Daniel Paulusma 2528 Feb 2020
 Bordeaux Graph Workshop 2019 (Bordeaux)
 Algorithms UK Workshop 2019 (Warwick)
 British Combinatorial Conference 2019 (Birmingham)
 Postgraduate Combinatorial Conference 2019 (Oxford)
 Workshop on evenholefree graphs 2019 (Belgrade)
Other
 Together with Ben Bumpus, Ethan Kelly and Michael McKay, I am an organiser of the ePCC seminar, an online seminar series for PhD students and postdocs working in discrete mathematics and combinatorics.