Workshop on Extremal Graph Theory

CONFERENCES

Workshop on Extremal Graph Theory
(June 6, 2014, Moscow)

The workshop ``Extremal Graph Theory'' is aimed to bring together specialists who work in the fields of extremal combinatorics, probabilistic methods in discrete mathematics, random graphs, hypergraphs and related fields.

Registration

Workshop on Extremal Graph Theory, Moscow, June 6, 2014

Finding needles in exponential haystacks J. Spencer June 6, 2014 10:00 Moscow
Zero-one $k$-laws for $G(n,n^{-\alpha})$ M. Zhukovskii June 6, 2014 11:00 Moscow
Improved algorithms for colorings of simple hypergraphs and applications D. A. Shabanov June 6, 2014 11:30 Moscow
Proof of the Pósa–Seymour Conjecture E. Szemerédi June 6, 2014 12:30 Moscow
Zero-one $k$-laws and extended zero-one $k$-laws for random distance graphs S. Popova June 6, 2014 13:30 Moscow
Subsets of $Z/pZ$ with small Wiener norm and arithmetic progressions I. D. Shkredov June 6, 2014 14:00 Moscow
Limits of local algorithms for randomly generated constraint satisfaction problems D. Gamarnik June 6, 2014 16:00 Moscow
Local clustering coefficient in preferential attachment graphs A. M. Krot, L. A. Ostroumova, E. A. Samosvat June 6, 2014 17:00 Moscow
Asymptotic behaviour of ranking algorithms in directed random networks N. Litvak June 6, 2014 17:30 Moscow
Boundary properties of factorial classes of graphs V. A. Zamaraev June 6, 2014 18:00 Moscow