Conference talks

• Partitioning a graph into a cycle and a sparse graph
  SIAM Discrete Mathematics Conference, Atlanta, 06/06/2016.
• Ramsey goodness of paths
  British Mathematical Colloquium, Bristol, 22/03/2016.
• Rainbow Matchings and Rainbow Connectedness
  Workshop on Extremal and Probabilistic Combinatorics, Birmingham, 22/09/2015.
• Rainbow Matchings and Rainbow Connectedness
  Eurocomb 2015, Bergen, 01/09/2015.
• Rainbow Matchings and Rainbow Connectedness
  Random Structures and Algorithms, Pittsburgh, 30/07/2015.
• Connectedness in tournaments
  2015 Colloquia in Combinatorics, London, 14/05/2015.
• Advantage in the discrete Voronoi game
  Joint Free University of Berlin - Tel Aviv University Workshop on Positional Games and Extremal Combinatorics, Tel Aviv, 04/03/2015.
• Connectedness in Tournaments
  Polish Combinatorial Conference, Bedlewo, 25/09/2014.
• Nonnegative sums in a set of numbers
  Summit 240 Conference, Budapest, 08/07/2014.
• Calculating Ramsey numbers by partitioning coloured graphs
  Annual Berlin-Pozna\'n Seminar, Hamburg, 23/05/2014.
• Partitioning 3-coloured complete graphs into three monochromatic paths
  Methods for Discrete Structures, Berlin, 04/11/2013.
• Covering coloured graphs by paths and cycles
  Cambridge University Combinatorics Group, Cambridge, 18/10/2012.
• Covering coloured graphs by paths and cycles
  Eurocomb Conference, Budapest, 29/08/2011.
• Partitioning 3-coloured complete graphs into 3 monochromatic~paths
  Lisboa Combinatorics Conference, Lisbon, 15/07/2011.
• Growth of graph powers
  French Combinatorics Conference, Paris, 28/06/2010.
• Growth of graph powers
  UCL Combinatorics Group, London, 17/11/2010.