ESF Mathematics Conference in Partnership with EMS and ERCOM
Perspectives in Discrete Mathematics
24 - 29 June 2012
Final Programme |
| SUNDAY 24 June |
17:00 onwards: Registration at the ESF desk
19.00: Welcome Drink
| MONDAY 25 June |
8:45 - 9:00: Welcome addresses
9:00 - 10:00: Laszlo Lovász, Eotvos Lorand University, HU
Nondetermistic property testing in graphs and notions of convergence
10:00 - 11:00: Jiri Matoušek, Charles University, CZ
Discrepancy, Bansal's algorithm and the determinant bound
11:00 - 11:30: Coffee break
11:30 - 12:00: Jozsef Balogh, University of Illinois, US
On the Chromatic Thresholds of Hypergraphs (UIUC and UIC)
12:00 - 12:30: Julia Böttcher, London School of Economics, UK
Tight Hamilton cycles in random hypergraphs
12:30 - 13:00: Jérémie Bouttier, Commissariat à l'énergie atomique et aux énergies alternatives, FR
Distance in planar maps: combinatorial and probabilistic aspects
13:00 - 15:30: Lunch
15:30-16:30: Carsten Thomassen, Technical University of Denmark, DK
The weak 3-flow conjecture and the (2+epsilon)-flow conjecture
16:30 - 17:00: Coffee break
17:00 -18:00: Poster Session
| TUESDAY 26 June |
9:00 - 10:00: Ben Green, University of Cambridge, UK
Point-line problems
10:00 - 10:30: Boris Bukh, University of Cambridge, UK
Generalized Erdős–Szekeres theorems
10:30 - 11:00: Guillaume Chapuy, CNRS, FR
The vertical profile of embedded trees
11:00 - 11:30: Group photo and Coffee break
11:30 - 12:00: David Conlon, University of Oxford, UK
Two extensions of Ramsey's Theorem
12:00 - 12:30: Hugo Duminil-Copin, University of Geneva, CH
Self-avoiding walks on the hexagonal lattice
12:30 - 13:00: Nikolaos Fountoulakis, University of Birmingham, UK
Bootstrap percolation in power-law random graphs
13:00 - 15:30: Lunch
15:30 - 16:00: Ervin Gyori, Renyi Institute, HU
2-factors in Hamiltonian graphs
16:00 - 16:30: Thomas Henning, ETH Zurich, CH
Ramsey Properties of Random Hypergraphs: the 0-Statement for Cliques
16:30 - 17:00: Coffee break
17:00 - 18:00: Poster Session
18:00 - 19:00: Open Problems Session
| WEDNESDAY 27 June |
9:00 - 10:00: Penny Haxell, University of Waterloo, CA
Packing and covering in uniform hypergraphs
10:00 - 11:00: Nicholas Wormald, University of Waterloo, CA
Small subgraph conditioning, cycle factors, restricted permutations, and combs
11:00 - 11:30: Coffee break
11:30 - 12:00: Mihyun Kang, Technische Universität Graz, AT
Phase transition in random graph processes through the lens of PDE and singularity analysis
12:00 - 12:30: Daniel Král, Charles University, CZ
Quasirandom Permutations
12:30 - 13:00: Martin Loebl, Charles University, CZ
Complexity of graph polynomials
13:00 - 15:30: Lunch
15:30: Excursion and free time
| THURSDAY 28 June |
9:00 - 10:00: Balázs Szegedy,University of Toronto, CA
On analytic aspects of Szemeredi's regularity lemma
10:00 - 10:30: Tobias Müller, Utrecht University, NL
First order logic and random geometric graphs
10:30 - 11:00: Richard Mycroft, University of Birmingham, UK
A geometric theory of hypergraph matching
11:00 - 11:30: Coffee break
11:30 - 12:00: Xavier Pérez-Giménez, Max-Plack-Institut für Informatik, DE
Asymptotic enumeration of sparse strongly connected digraphs by vertices and edges
12:00 - 12:30: Miklos Ruszinkó, Alfred Renyi Institute of Mathematics, HU
Uniform hypergraphs containing no grids
12:30 - 13:00: Wojciech Samotij, University of Cambridge, UK
Independent sets in hypergraphs
13:00 - 16:00: Lunch
16:00 -17:00: Endre Szemerédi, Rutgers University, US
Is Laziness Paying off
17:00 - 17:30: Coffee break
17:30 - 18:30: Look Forward Session
20:00: Get together and Conference Dinner
| FRIDAY 29 June |
9:00 - 10:00: Michael Krivelevich, Tel Aviv University, IL
Resilience and robustness in graphs
10:00 - 10:30: Asaf Shapira, Tel-Aviv University, IL
Ramsey Theory, Integer Partitions and a New Proof of the Erdos-Szekeres Theorem
10:30 - 11:00: Mathias Schacht, Universität Hamburg, DE
Extremal combinatorics in sparse random and pseudorandom structures
11:00 - 11:30: Coffee break
11:30 - 12:30: Jacob Fox, Massachusetts Institute of Technology, US
The sparse regularity method
12:30: Lunch and Departure
Partnership
This conference is organised by the European Science Foundation (ESF) in partnership with the European Molecular Biology Organization (EMBO).
