Conference on
Enumeration and Probabilistic Methods in Combinatorics
An activity of CONSOLIDER MATHEMATICA
Programme
|
|
Monday, June 25 |
|
09:00 - 09:30 |
Registration |
|
09:30 - 10:30 |
Random discrete structures: naοve approach Tomasz Luczak |
|
10-30 11:00 |
Coffee break |
|
11:00 - 11:30 |
The shape of Polya trees Bernhard Gittenberger |
|
11:30 - 12:00 |
Graph classes with given 3-connected components: asymptotic counting and critical phenomena Omer Gimιnez |
|
12:00 - 13:00 |
Random Geometric Graphs Josep Diaz |
|
13:00 14:30 |
Lunch Break |
|
14:30 - 15:00 |
Area Laws for Symmetry Classes of Staircase Polygons Uwe Schwerdtfeger |
|
15:00 - 15:30 |
Majority Bootstrap Percolation on the Hypercube Jozsef Balogh |
|
15:30 - 16:00 |
Complexity of the Cover Polynomial Holger Dell |
|
16:00 16:30 |
Break |
|
16:30 - 17:30 |
Branched Polymers Peter Winkler |
|
Tuesday, June 26 |
|
|
09:30 - 10:30 |
The degree sequence of random outerplanar graphs Angelika Steger |
|
10:30 10:40 |
Group picture |
|
10:40 11:00 |
Coffee Break |
|
11:00 11:30 |
Phase transition in random intersection graphs Katarzyna Rybarczyk |
|
11:30 12:00 |
Asymptotic growth of minor-closed classes of graphs Olivier Bernardi |
|
12:00 - 13:00 |
Properties of regular graphs of large girth Nicholas Wormald |
|
13:00 14:30 |
Lunch break |
|
14:30 15:00 |
Why is
the chromatic polynomial a polynomial Johann Makowsky |
|
15:00 15:30 |
A
local limit theorem for the critical random graph Tobias Muller |
|
15:30 - 16:00 |
Break |
|
16:00 16:30 |
Cuckoo
Hashing and Random Bipartite Graphs Reinhard Kutzelnigg |
|
16:30 - 17:00 |
Some
results in the chromatic and the First-Fit chromatic number of sparse
graphs Manouchehr Zaker |
|
Wednesday, June 27 |
|
|
09:30 - 10:30 |
Random graphs on surfaces Colin McDiarmid |
|
10:30 11:00 |
Coffee Break |
|
11:00 11:30 |
Bijections for
permutation tableaux Sylvie Corteel |
|
11:30 - 12:00 |
A Multivariate
Interlace Polynomial Bruno Courcelle |
|
12:00 - 13:00 |
Analytic combinatorics of some urn models Philippe Flajolet |
|
13:00 14:30 |
Lunch break |
|
17:00 |
Guided visit |
|
20:30 |
Dinner |
|
Thursday, June 28 |
|
|
09:30 - 10:30 |
Random discrete nonplanar surfaces Gilles Schaeffer |
|
10:30 11:00 |
Coffee Break |
|
11:00 11:30 |
The longest cycle in
the supercritical random graph Graeme Kemkes |
|
11:30 - 12:00 |
Expander relational
structures and colouring problems Gabor Kun |
|
12:00 - 13:00 |
Random, pseudo-random
and not-so-random graphs Andrew Thomason |
|
13:00 14:30 |
Lunch Break |
|
14:30 15:00 |
The Equivalence of Three
Weighted graph Polynomials Steven Noble |
|
15:00 15:30 |
Random Constraint
Optimization: The case of Max-Cut Lefteris Kirousis |
|
15:30 - 16:00 |
Asymptotic enumeration
of 2-covers and line graphs Dudley Stark |
|
16:00 16:30 |
Break |
|
16:30 - 17:30 |
Left-to-right maxima in words and multiset permutations Herbert Wilf |
|
Friday, June 29 |
|
|
09:30 - 10:30 |
Non-crossing partitions on an annulus Christian Krattenthaler |
|
10:30 11:00 |
Coffee Break |
|
11:00 11:30 |
A bijection between 2-triangulations and pairs of non-crossing Dyck
paths |
|
11:30 - 12:00 |
Eric Fusy A bijection between loopless maps and triangulations |
|
12:00 - 13:00 |
Random graphs and the
ferromagnet Geoffrey Grimmett |