Talks
Videos of select talks:
From Robust Sublinear Expanders to Additive Number Theory via Rainbow Cycles
IAS Computer Science and Discrete Mathematics Seminar.
February 2023.
Robust Sublinear Expanders, and an Application Towards the Erdős-Gallai Conjecture
IAS Computer Science and Discrete Mathematics Seminar.
September 2022.
The absorption method, and an application to an old Ramsey problem
IAS Computer Science and Discrete Mathematics Seminar.
March 2022.
Turan numbers of sunflowers
Oxford Discrete Mathematics and Probability Seminar.
November 2021.
Tournament quasirandomness from local counting
Extremal and Probabilistic Combinatorics Webinar.
May 2020.
Conference or Workshop Talks:
2024:
March - Atlanta Lecture Series XXVIII, Robust sublinear expanders (slides).
2023:
July - Combinatorics Day at TAU, Tel Aviv. Robust sublinear expanders (slides).
June - Random Structures and Algorithms, Pittsburgh. Towards the Erdős-Hajnal Conjecture (slides).
June - CanaDAM conference, Winnipeg. Unit and distinct distances in typical norms (slides).
May - EXCILL IV Conference, UIUC. Unit and distinct distances in typical norms (slides).
January - Combinatorics Workshop at Oberwolfach. Towards the Erdős-Hajnal Conjecture (slides).
2022:
December - Graph Theory Workshop at McGill research centre in Barbados, 2022, Towards the Erdős-Hajnal conjecture for P_5-free graphs (board talk).
October - AMS Special Session on Ramsey Theory, Tight Ramsey bounds for multiple copies of a graph (board talk).
August - Recent Advances in Probabilistic and Extremal Combinatorics, Switzerland Towards the Erdős-Gallai cycle decomposition conjecture (slides).
June - SIAM Conference on Discrete Mathematics 2022, CMU, Pittsburgh, Turan numbers of sunflowers (slides).
April - Combinatorics, Probability and Computing Workshop at Oberwolfach. Towards the Erdős-Gallai cycle decomposition conjecture (slides).
January - Graph Theory Workshop at Oberwolfach. Clique minors in graphs with a forbidden subgraph (slides).
2021:
September - Eurocomb, online. The intersection spectrum of 3-chromatic intersecting hypergraphs (slides).
July - SIAM Conference on Discrete Mathematics, online. Erdős-Szekeres theorem for multidimensional arrays (slides).
2020:
March - Joint FU Berlin–Tel Aviv University Workshop on Ramsey Theory, Tel-Aviv. Erdős-Szekeres theorem for multidimensional arrays (slides, long)
January - Combinatorics Workshop at Oberwolfach. Erdős-Szekeres theorem for multidimensional arrays (slides)
2019:
September - Workshop on Probabilistic and Extremal Combinatorics in Banff, Nearly-linear monotone paths in edge-ordered graphs (video recording)
August - British Combinatorial Conference, Birmingham. Covering graphs by monochromatic trees and Helly-type results for hypergraphs (slides)
July - Random Structures and Algorithms, Zürich. Covering graphs by monochromatic trees and Helly-type results for hypergraphs (slides)
2018:
June - SIAM Conference on Discrete Mathematics, in Denver. Bipartite Ramsey number of paths and cycles. (slides).
2017:
August - Eurocomb 2017, Vienna. Directed Ramsey number for trees. (slides).
August - Random Structures and Algorithms, Poland. Directed Ramsey number for trees. (slides).
Colloquium and Seminar Talks:
2024:
March - Rutgers Discrete Mathematics Seminar, Essentially tight bounds for rainbow cycles in proper edge-colourings (slides).
March - Combinatorics, geometry and topology seminar, IST Austria, Unit and distinct distances in typical norms (slides).
March - Colloquium in Mathematics, Masaryk University, Robust Sublinear Expanders (slides).
March - Research seminar in Discrete Mathematics BIMSA, Essentially tight bounds for rainbow cycles in proper edge-colourings (slides) (video).
March - GT Graph Theory & Combinatorics Seminar, Essentially tight bounds for rainbow cycles in proper edge-colourings (slides).
February - CMU ACO Seminar, Robust Sublinear Expanders (slides).
February - Princeton Theory (of Computing) Lunch, Robust Sublinear Expanders (recording).
January - Stanford Combinatorics Seminar, Robust Sublinear Expanders (slides).
January - EPFL Seminar in Mathematics, Local to Global Principle in Discrete Mathematics.
2023:
December - NYU Theory Seminar, Robust Sublinear Expanders (slides).
December - Umea University Discrete Mathematics seminar, Robust Sublinear Expanders (slides).
December - Stony Brook Probability and Combinatorics seminar, Robust Sublinear Expanders (slides).
October - IBS Korea Discrete Math Seminar, Essentially tight bounds for rainbow cycles in proper edge-colourings (board talk) (video).
April - Budapest Big Combinatorics + Geometry (BBC+G) Seminar, Unit and distinct distances in typical norms (slides) (video).
April - Combinatorics Learning Seminar, Princeton Robust Sublinear Expanders (board talk).
April - Modern Coding Theory and Expanders Seminar, Princeton CS and IAS Robust Sublinear Expanders (board talk).
March - Emory Colloquium in Combinatorics, Robust Sublinear Expanders (slides) .
February - UCSD Department of Mathematics Colloquium, Robust Sublinear Expanders (slides) .
February - IAS Computer Science and Discrete Mathematics Seminar, From Robust Sublinear Expanders to Additive Number Theory via Rainbow Cycles. (video).
February - Rutgers Discrete Math Seminar, Unit and distinct distances in typical norms (board talk).
November - MIT-Harvard-MSR Combinatorics Seminar, Towards the Erdős-Gallai cycle decomposition conjecture (slides).
2022:
November - Graz Colloquium in Combinatorics, Decomposition Problems (slides).
September - IAS Computer Science and Discrete Mathematics Seminar, Robust Sublinear Expanders, and an Application Towards the Erdős-Gallai Conjecture (video).
September - IAS Short Talks, Robust Sublinear Expanders (video).
May - Graz Combinatorics Seminar, Covering random graphs with monochromatic components (slides).
March - IAS Computer Science and Discrete Mathematics Seminar, The absorption method, and an application to an old Ramsey problem (video).
March - Princeton Applied and Computational Matehmatics Colloquium, Two classical decomposition problems (board talk).
March - Discrete Mathematics and Algebra Seminar at University of Delaware, Tight Ramsey bounds for multiple copies of a graph (board talk).
January - Birmingham Combinatorics and Probability Seminar, Tight Ramsey bounds for multiple copies of a graph (board talk).
2021:
November - Rutgers Discrete Math Seminar, Tight Ramsey bounds for multiple copies of a graph (board talk).
November - Oxford Discrete Mathematics and Probability Seminar, Turan numbers of sunflowers (slides) (video).
October - Princeton Discrete Math Seminar, Tight Ramsey bounds for multiple copies of a graph (board talk).
March - Mittagsseminar at ETH Zürich, Large cliques and independent sets all over the place (slides, short).
2020:
November - Combinatorics seminar at Tel Aviv University, The intersection spectrum of 3-chromatic intersecting hypergraphs (slides, long).
May - Stanford Online Combinatorics Seminar Large cliques and independent sets all over the place, (slides).
May - Extremal and Probabilistic Combinatorics Webinar, Tournament quasirandomness from local counting (video recording).
2019:
November - Combinatorics seminar at University of Warwick, Erdős-Szekeres theorem for multidimensional arrays (slides, long).
November - Mittagsseminar at ETH Zürich, Erdős-Szekeres theorem for multidimensional arrays (slides, short).
May - Mittagsseminar at ETH Zürich, Covering random graphs by monochromatic trees and Helly-type results for hypergraphs (slides).
2018:
October - Mittagsseminar at ETH Zürich, Nearly-linear monotone paths in edge-ordered graphs (slides).
May - Combinatorics Seminar at University of Cambridge, Minimum saturated families of sets (board talk).
April - Graduate Seminar in Probability at ETH Zürich, From correlation inequalities to extremal set theory and back (board talk).
February - Mittagsseminar at ETH Zürich, Minimum saturated families of sets (slides).
2017:
March - Mittagsseminar at ETH Zürich, Directed Ramsey number for trees. (slides).
2016:
March - Part III Seminar at University of Cambridge, Splitting Directed Graphs (board talk).