Workshop on structure and randomness in hypergraphs
organised by Peter Allen, Julia Böttcher, Jozef Skokan

Venue

  • Columbia House, London School of Economics, Mathematics Department
    Room: COL 2.01 (second floor)

    the entrance to Columbia House is on the Aldwych

    (do not try to walk through the campus, it is a building site
    at the moment; walk along Kingsway instead)

  • campus map

Schedule

  • Monday
    09:30 Coffee, Tea & Fruit
    10:00 Talk: Asaf Shapira, Two Erdos-Hajnal-type Theorems in Hypergraphs
    11:00 Problem Session
    12:30 Lunch
    13:30 Coffee & Tea
    14:00 Group Work
    17:00 Wine & Cheese

  • Tuesday
    09:30 Coffee, Tea & Fruit
    10:00 Talk: Allan Lo, Monochromatic tight cycle partition for 3-graphs
    11:00 Talk: Oleg Pikhurko, The minimum number of triangles in graphs of given order and size
    12:00 Lunch
    13:00 Coffee & Tea
    13:30 Group Work
    15:30 Cake
    16:00 Group Work

  • Wednesday
    09:30 Coffee, Tea & Fruit
    10:00 Talk: Gonzalo Fiz Pontiveros, Virtually fibering random right-angled coxeter groups
    11:00 Talk: Mihyun Kang, High-order components in random hypergraphs
    12:00 Lunch
    13:00 Coffee & Tea
    13:30 Group Work
    16:00 Cake
    16:30 Progress Meeting

    19:00 Conference Dinner
    (Coopers, 49 Lincoln's Inn Fields)

  • Thursday
    09:30 Coffee, Tea & Fruit
    10:00 Talk: Liana Yepremyan, Rainbow factors in hypergraphs
    11:00 Talk: Jan Hladky, Cut distance for graphs and hypergraphs
    12:00 Lunch
    13:00 Coffee & Tea
    13:30 Group Work
    15:30 Cake
    16:00 Group Work

  • Friday
    09:30 Coffee, Tea & Fruit
    10:00 Talk: Maya Stein, Degree conditions for embedding trees
    11:00 Group Work
    13:00 Pizza & Wine
    14:00 Progress Meeting

Abstracts

Problems

This workshop is supported by EPSRC grant EP/P032125/1, a Heilbronn Focused Research Grant, and the London School of Economics.

Julia Böttcher    Last modified: Mon Dec 17 14:01:23 GMT 2018