Workshop on Extremal Graph Theory

6 June 2014

The Yandex workshop on extremal graph theory is part of the 9th International Computer Science Symposium and aims at brining together specialists who work in extremal combinatorics, probabilistic methods in discrete mathematics, random graphs, hypergraphs and related fields.

Speakers in this workshop, which is organised by Andrey Raigorodsky, include David Gamarnik (MIT), Joel Spencer (Courant Institute, New York University), Endre Szemerédi (Rutgers University) and others.

This workshop will take place in Yandex’s Moscow office on June 6, 2014.

The talks will start at 10:00 am with on-site registration open from 9:30 am.

To be eligible for on-site registration, participants fist need to register online.

The language of this workshop is English.


10:00Finding Needles in Exponential Haystacks
Joel Spencer
New York University's Courant Institute of Mathematical Sciences
11:00Zero-one k-laws for G(n,n−α)Watch
11:30Improved algorithms for colorings of simple hypergraphs and applications
Dmitry Shabanov
Lomonosov Moscow State University
12:00Coffee Break
12:30Proof of the Pósa−Seymour Conjecture
Endre Szemerédi
Rutgers University
13:30Zero-one k-laws and extended zero-one k-laws for random distance graphs
Svetlana Popova
Lomonosov Moscow State University
14:00Subsets of Z/pZ with small Wiener norm and arithmetic progressions
Ilya Shkredov
Lomonosov Moscow State University
16:00Limits of Local Algorithms for Randomly Generated Constraint Satisfaction ProblemsWatch
17:00Local clustering coefficient in preferential attachment graphs
Alexander Krot
Moscow Institute of Physics and Technology
17:30Asymptotic behaviour of ranking algorithms in directed random networks
Nelly Litvak
University of Twente
18:00Boundary properties of factorial classes of graphs
Victor Zamaraev
National research university "Higher school of economics".