Yani Pehova

About me

I currently work as a researcher at SW7 Group in London, where I think about graphs, combinatorial optimisation, algorithms, and life.

I obtained my PhD from the University of Warwick under the supervision of Prof Daniel Král'.

Before that I did Part III of the Mathematical Tripos at the University of Cambridge, specialising in Combinatorics and Number Theory. 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.

Research

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.

Organised events

I am currently organising a novelty workshop called Young Researchers in Combinatorics which has been postponed to July 2022. An online mini-workshop took place in the week of 20-24 July 2020.

Publications

R. Montgomery, A. Muyesser, Y. Pehova. Transversal factors and spanning trees. Adv. Comb. (accepted) arXiv:2107.04629

T.F.N. Chan, D. Kráľ, J. Noel, Y. Pehova, M. Sharifzadeh, J. Volec. Characterization of quasirandom permutations by a pattern sum. Random Structures Algorithms 57 (2020), no. 4, 920–939. arXiv:1909.11027

A. Liebenau, Y. Pehova. An approximate version of Jackson's conjecture. Combin. Probab. Comput. 29 (2020), no. 6, 886–899. arXiv:1907.08479

A. Blumenthal, B. Lidický, Y. Pehova, F. Pfender, O. Pikhurko, J. Volec. Sharp bounds for decomposing graphs into edges and triangles. Combin. Probab. Comput. (accepted) arXiv:1909.11371

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. SIAM J. Discrete Math. 34 (2020), no. 2, pp1001–1010. arXiv:1806.03530

D. Kráľ, B. Lidický, T. Martins, Y. Pehova. Decomposing graphs into edges and triangles. Combin. Probab. Comput. 28 (2019), no. 3, 465-472. arXiv:1710.08486

Talks

"Tilings in graphs with sublinear independence number" at Combinatorics seminar, 17 January 2020, University of Warwick, UK

"Tight packings of Hamiton cycles in bipartite digraphs" at Joint DIMEA and FORMELA seminar, 16 December 2019, Masaryk University, Brno, Czech Republic

"Characterization of quasirandom permutations by a pattern sum", at Joint ICS combinatorics and IM graph limits seminar, 13 December 2019, Czech Academy of Sciences, Prague, Czech Republic

"Characterization of quasirandom permutations by a pattern sum" at Combinatorial Theory Seminar, 3 December 2019, University of Oxford, UK

"Quasirandomness in large permutations and the flag algebra method" at SPAAM Seminar, 26 November 2019, University of Warwick, UK

"An approximate version of Jackson's conjecture" at Combinatorics Seminar, 21 November 2019, University of Cambridge, UK

"Packing Hamilton cycles in bipartite directed graphs" at Combinatorics Study Group, 18 October 2019, Queen Mary University of London, UK

"Forcing quasirandomness in large permutations" at Maths Postgraduate Seminar, 9 October 2019, University of Warwick, 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 (mini-symposium talk)

"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 correspondence address is:

2 Allen st

W8 6BH London

My email is: y.pehova@warwick.ac.uk