Before that I did Part III of the Mathematical Tripos at the University of Cambridge, specialising in Combinatorics and Number Theory. I wrote my Part III essay on the topic of Robust Expansion in Graphs under the supervision of Prof Andrew Thomason.
Before that I was an undergraduate at Murray Edwards College, University of Cambridge.
You can find a copy of my CV here.
Here is a list of events I have attended, including upcoming events.
If you are my student, click here for my teaching page.
My interests lie mainly in the area of extremal combinatorics. In the past I have looked at ways to decompose the edge set of a given graph into small or sparse subgraphs, limits of combinatorial objects and their applications to extremal problems, and graph tilings in various settings.
A. Liebenau, Y. Pehova. An approximate version of Jackson's conjecture. (submitted) arXiv:1907.08479
A. Blumenthal, B. Lidický, Y. Pehova, F. Pfender, O. Pikhurko, J. Volec. Sharp bounds for decomposing graphs into edges and triangles. Proceedings of EuroComb '19 (accepted)
J. Geneson, A. Holmes, X. Liu, D. Neidinger, Y. Pehova, I. Wass. Ramsey numbers of ordered graphs under graph operations. arXiv:1902.00259
R. Nenadov, Y. Pehova. On a Ramsey-Turán variant of the Hajnal-Szemerédi theorem. (submitted) arXiv:1806.03530
D. Kráľ, B. Lidický, T. Martins, Y. Pehova. Decomposing graphs into edges and triangles. Combin. Probab. Comput. 28, 465-472. (arXiv:1710.08486)
"An approximate version of Jackson's conjecture" at Combinatorics Seminar, 21 November 2019, University of Cambridge, UK
"Sharp bounds for decomposing graphs into edges and triangles" at EuroComb Conference, 26-30 August 2019, Bratislava, Slovakia
"An approximate version of Jackson's conjecture" at British Combinatorial Conference, 29 July 2019, Birmingham, UK
"An approximate version of Jackson's conjecture" at Postgraduate Combinatorial Conference, 10-12 June 2019, Oxford, UK
"Sharp bounds for decomposing graphs into edges and triangles" at CanaDAM Conference, 30 May 2019, Vancouver, Canada
"Sharp bounds for decomposing graphs into edges and triangles" at Combinatorics Seminar, 28 March 2019, University of Birmingham, UK
"Tilings in graphs with sublinear independence number" at Combinatorics, Games and Optimisation Seminar, 28 Feb 2019, London School of Economics
"Sharp bounds for decomposing graphs into edges and triangles" at Combinatorics Seminar, 29 Jan 2019, University of Bristol
"On a Ramsey-Turán variant of the Hajnal-Szemerédi theorem" at First Southwestern German Workshop on Graph Theory, 28 Aug 2018, Karlsruhe Institute of Technology
"Ordered Ramsey Theory" at Warwick Postgraduate Colloquium in Computer Science, 29 June 2018, University of Warwick, UK
"Decomposing Graphs Into Edges and Triangles" at International Workshop on Graph Limits, 29 Jan - 2 Feb 2018, ENS Lyon, France
"Decomposing Graphs Into Edges and Triangles" at Pure Mathematics Postgraduate Forum, 20 Nov 2017, University of Lancaster, UK
How to reach me
My department address is:
University of Warwick
CV4 7AL Coventry
My email is: firstname.lastname@example.org