Extremal Combinatorics

Home > Workshops > 2014 > Extremal Combinatorics

Extremal Combinatorics

 14 - 18 Jul 2014

ICMS, 15 South College Street Edinburgh

  • Peter Keevash, University of Oxford
  • Daniel Král, University of Warwick
  • Oleg Pikhurko, University of Warwick

About:

This workshop focused on extremal problems for graphs and set systems, in particular, the regularity and probabilistic methods, Ramsey theory, Turan-type problems, coloring, graph embedding and tiling, subgraph densities, flag algebras etc.

Speakers

  • Tomasz Luczak, Adam Mickiewicz University - On Manipulative Waiters

  • Tibor Szabo, Freie Universität Berlin - On the Cycles of Degree-3 Critical Graphs

  • Andrew Treglown, University of Birmingham - On Generalisations of the Hajnal-Szemeredi theorem

  • Richard Mycroft, University of Birmingham - Packings in Hypergraphs

  • Jozsef Balogh, University of Illinois & Szeged University - Hypergraph Containers

  • Anita Liebenau, University of Warwick - Minimal Ramsey Graphs for Multiple Colours

  • Tereza Klimosova, University of Warwick - Hereditary Properties of Permutations Are Strongly Testable

  • Jacob Fox, MIT - Cycle Packing

  • Daniela Kuhn, University of Birmingham - On the Structure of Oriented Graphs and Digraphs With Forbidden Tournaments or Cycles

  • Zoltan Furedi, Renyi Institute of Mathematics - Turan Numbers of Expanded Forests

  • Andrew Thomason, University of Cambridge - Containers for Hypergraphs

  • Jan Hladky, University of Warwick - Inhomogeneous Random Graphs

  • Laszlo M. Lovasz, MIT - The Height of the Tower in Szemeredi's Regularity Lemma

  • David Conlon, University of Oxford - Monochromatic Cycle Partitions in Local Edge Colourings

  • Deryk Osthus, University of Birmingham - Hamilton Cycles and Hamilton Decompositions

  • Dhruv Mubayi, University of Illinois - Hypergraph Turan Problems and Shadowss

  • Sergey Norin, McGill University - Exact Turan Numbers via Lagrangians

  • Jan Volec, University of Warwick - Rainbow Triangles in 3-Edge-Colored Graphs

  • Roman Glebov, ETH Zurich - Finitely Forcible Graphons

  • Endre Csoka, University of Warwick - Konig's Line Coloring and Vizing's Theorems for Graphings

  • Benny Sudakov, ETH Zurich - Judicious Partitions of Graphs

  • Boris Bukh, Carnegie Mellon University - A Bound on the Number of Edges in Graphs Without an Even Cycle

  • Wojciech Samotij, University of Cambridge - Counting H-Free Graphs

  • Diana Piguet, University of West Bohemia - Extensions of Mantel's Theorem