Program (pdf)

June 30, Sunday

16:00-20:00   Registration   and   Welcome Drink  (map)

July 1, Monday

9:00-9:30Opening Ceremony (video)
Opening speech by Vera T. Sós (text, slides)
Welcome speech by József Pálinkás (text)
9:30-10:20 Béla Bollobás: The Phase Transition in the Erdős-Rényi Random Graph Process (video)
10:20-11:05Coffee break
11:05-11:55 Vilmos Totik: Erdős on polynomials (video, slides)
12:00-12:50 Ben Green: The sum-free set constant is ⅓ (video, slides)
12:50-14:30Lunch break
  Reading Room Large Lecture Hall Ceremonial Hall Small Lecture Hall Dome Hall
 Number TheoryGallai Memorial SessionCombinatoricsAnalysisProbability Theory
14:30-15:00 Andrzej Schinzel:
On sum of powers of the positive integers
(slides)
Alexander Schrijver:
Tibor Gallai's basic work in combinatorial optimization
Tom Sanders:
Roth's theorem on arithmetic progressions
(slides)
Benjamin Weiss:
Paul Erdős as an ergodic theory pioneer
Jean-François Le Gall:
The range of tree-indexed random walk
(slides)
15:05-15:35 Cameron Stewart:
On the greatest prime factor of 2n-1
(slides)
Bjarne Toft:
Gallai, colourings and critical graphs - a 50 year anniversary
(slides)
Ehud Friedgut:
A sharp threshold for Ramsey properties of random sets of integers
(slides)
Pertti Mattila:
Singular integrals on subsets of metric groups
(slides)
Bálint Tóth:
Erdős-Rényi Random Graphs + Forest Fires = Self - Organized Criticality
(slides)
15:40-16:10 Robert Tichy:
Metric Discrepancy Theory
(slides)

Gyula O.H. Katona:
Results on largest families of sets, following theorems of Sperner and Erdős
Zoltán Buczolich:
Divergent square averages and related topics
(slides)
Zhan Shi:
Local time of random walks on trees
(slides)
16:10-16:55Coffee break
16:55-17:25 Attila Pethő:
Primes and the Internet
(slides)
Gábor Simonyi:
Applications and extensions of a theorem of Gallai
(slides)
Asaf Shapira:
Deterministic vs Non-deterministic Graph Property Testing
(slides)
Assaf Naor:
Super-expanders
(slides)
Krzysztof Burdzy:
Forward Brownian Motion
(slides)
17:30-18:00 Cécile Dartyge:
The Chebychev's problem for the twelfth cyclotomic polynomial
(slides)
László Lovász:
Tibor Gallai and matching theory
(slides)
József Balogh:
Phase transitions in Ramsey-Turán Theory
(slides)

Bálint Virág:
Independent sets in sparse graphs
18:05-18:35 Christian Mauduit:
Prime Number Theorems for deterministic sequences



Márton Balázs:
Asymmetric exclusion: a way to anomalous scaling
(slides)

July 2, Tuesday

9:00-9:50 Timothy Gowers: Erdős and arithmetic progressions (video, slides)
9:50-10:35Coffee break
10:35-11:25 Daniel Mauldin: Steinhaus' problem on simultaneous tilings of the plane (video, slides)
11:30-12:20 János Pach: Paul Erdős and the beginnings of geometric graph theory (video)
12:20-14:00Lunch break
14:00-14:30Poster session
  Reading Room Large Lecture Hall Ceremonial Hall Small Lecture Hall Dome Hall
 Number TheoryTheory of ComputingCombinatoricsApproximation TheorySet Theory
14:30-15:00 Harold Diamond:
Optimal Chebyshev Bounds for Beurling Generalized Numbers
(slides)
Miklós Ajtai:
Lower Bounds for RAMs and Quantifier Elimination
Miklós Simonovits:
The exact solution of the Erdős-T. Sós conjecture I
Dany Leviatan:
Weighted D-T moduli revisited and applied
(slides)
Sy-David Friedman:
Cardinals and Ordinal Definability
(slides)
15:05-15:35 Robert Tijdeman:
Representations as sums of products of fixed primes
(slides)
Pavel Pudlák:
The proof complexity of the finite Ramsey theorem
(slides)
Endre Szemerédi:
The exact solution of the Erdős-T. Sós conjecture II
Giuseppe Mastroianni:
Lp-convergence of Lagrange and Hermite interpolation
István Juhász:
Resolvability of topological spaces
(slides)
15:40-16:10 Helmut Maier:
Smooth numbers and zeros of Dirichlet L- functions
(slides)
Boaz Barak:
On Algebraic vs Combinatorial Computational Problems
(slides)
Oleg Pikhurko:
Asymptotic Structure of Graphs with the Minimum Number of Triangles
(slides)
Manfred Golitschek:
On the L∞-norm of the L2-spline projector
(slides)
Piotr Koszmider:
Uncountable combinatorics of Boolean algebras in Banach spaces
16:10-16:55Coffee break
16:55-17:25 Sergei Konyagin:
Numbers that become composite after changing one or two digits
(slides)
Chris Umans:
On sunflowers and matrix multiplication
Ralph Faudree:
Saturation Numbers for Graphs
(slides)
Allan Pinkus:
On Ridge Functions
Lajos Soukup:
On properties of families of sets
17:30-18:00 Kevin Ford:
Multiplicative structure of integers, shifted primes and arithmetic functions
(slides)
Moses Charikar:
Local Global Tradeoffs in Metric Embeddings
(slides)
Deryk Osthus:
Hamilton decompositions of regular expanders: a proof of Kelly's conjecture for large tournaments
(slides)
Songping Zhou:
A New Important Development to Uniform Convergence of Trigonometric Series

Algebra

Aner Shalev:
Words and Groups
(slides)
18:05-18:35 Gérald Tenenbaum:
On the core of an integer
(slides)
László Babai:
Testing Isomorphism of Steiner 2-designs and Strongly Regular Graphs



19:00-19:30Erdős 100, a film directed by George Csicsery

July 3, Wednesday

9:00-9:50 Noga Alon: Paul Erdős and Probabilistic Reasoning (video, slides)
9:50-10:35Coffee break
10:35-11:25 Elon Lindenstrauss: Spectral gap and self-similar measures (video)
11:30-12:20 Carl Pomerance: Paul Erdős and the rise of statistical thinking in elementary number theory (video, slides)
12:20-14:00Lunch break
14:00-14:30Poster session
  Reading Room Large Lecture Hall Ceremonial Hall Small Lecture Hall Dome Hall
 Number TheoryGraph HomomorphismsCombinatoricsAnalysisProbability Theory
14:30-15:00 András Sárközy:
On additive and multiplicative decompositions of subsets of Fp
(slides)
Balázs Szegedy:
On the Erdős-Simonovits, Sidorenko Conjecture
Gábor Tardos:
On the local chromatic number and its variants
(slides)
Paul Humke:
Differentiation properties related to the Keleti perimeter to area conjecture
(slides)
Domokos Szász:
Erdős-type theorems for billiard models
(slides)
15:05-15:35 Bob Hough:
The least modulus of a covering set is uniformly bounded
(slides)
Xuding Zhu:
Circular flow of signed graphs
(slides)
Andrew Thomason:
List colouring of graphs and hypergraphs
(slides)
Kenneth Falconer:
Some Problems in Measure Combinatorial Geometry
(slides)
Itai Benjamini:
Random walk on planar graphs
(slides)
15:40-16:10 Antal Balog:
The 'Decomposition Theorem'
(slides)
Pavol Hell:
Combinatorial Dichotomy Classifications
(slides)
Andrzej Ruciński:
On a Hamiltonian Problem For Triple Systems
(slides)

József Beck:
What is geometric entropy, and does it really increase
(slides)
16:10-16:55Coffee break
16:55-17:25 Javier Cilleruelo:
Infinite Sidon sequences
(slides)
Alex Scott:
Discrepancy of graphs and hypergraphs
(slides)
Mathias Schacht:
Extremal results in random graphs
(slides)

Tamás Móri:
A random graph model with duplication
(slides)
17:30-18:00 Gyula Károlyi:
Restricted set addition in finite groups
Patrice Ossona de Mendez:
Low Tree-depth Decompositions
(slides)
Fan Chung:
Recent results and problems in spectral graph theory

Gábor Pete:
Exceptional times in dynamical percolation, and the Incipient Infinite Cluster
18:05-18:35
Jaroslav Nešetřil:
Orderings of sparse graphs
(slides)
Michael Krivelevich:
Biased positional games and the Erdős paradigm
(slides)


19:00-19:30Erdős 100, a film directed by George Csicsery

July 4, Thursday

9:00-9:50 Terence Tao: Sets with few ordinary lines (video, slides)
9:50-10:35Coffee break
10:35-11:25 Yuval Peres: Coloring a graph arising from a lacunary sequence, Diophantine approximation, and constructing a Kakeya set: Applications of the probabilistic method (video, slides)
11:30-12:20 Vojtěch Rödl: On two Ramsey type problems for Kt+1-free graphs (video)
12:20-14:00Lunch break
14:00-14:30Poster session
  Reading Room Large Lecture Hall Ceremonial Hall Small Lecture Hall Dome Hall
 Number TheoryRamsey TheoryCombinatoricsDiophantine Number TheoryAlgebra
14:30-15:00 Jean-Marc Deshouillers:
On the coefficients of the powers of a Laurent series algebraic over Fq(X)
Benny Sudakov:
Paul Erdős and Graph Ramsey Theory
(slides)
Alexandr Kostochka:
On a conjecture by Gallai and a question by Erdős
(slides)
Kálmán Győry:
Perfect powers in products with terms from arithmetic progression - A survey
(slides)
László Pyber:
Random generation of finite and profinite groups
15:05-15:35 Vsevolod Lev:
Flat-containing and shift-blocking sets in finite vector spaces
(slides)
Jacob Fox:
A relative Szemerédi theorem
(slides)
Gil Kalai:
Some old and new problems in combinatorics and geometry
(slides)
Mike Bennett:
Shifted powers in binary recurrence sequences
(slides)
Jan-Christoph Schlage-Puchta:
Origami and the product replacement algorithm
(slides)
15:40-16:10 Igor Shparlinski:
Distribution of Points on Varieties over Finite Fields
(slides)
Yoshiharu Kohayakawa:
The regularity method and Ramsey theory
(slides)
János Körner:
From intersection theorems to capacity results
(slides)
Yann Bugeaud:
On the continued fraction expansion of algebraic numbers
(slides)
Miklós Abért:
A p-adic analogue of the Erdős-Turán statistical group theory
16:10-16:55Coffee break
16:55-17:25 Joël Rivat:
On the digits of prime numbers
(slides)
József Solymosi:
On the sum-product problem
(slides)
Svante Janson:
Graph properties, graph limits and entropy
(slides)
Jan-Hendrik Evertse:
P-adic decomposable form inequalities
(slides)
Alexander Ivanov:
Majorana representation of the Monster
(slides)
17:30-18:00 András Biró:
A Poisson-type summation formula with automorphic weights
(slides)
Ronald Graham:
Paul Erdős and Egyptian Fractions
(slides)
Dhruv Mubayi:
Intersection Theorems for Finite Sets
(slides)
Ákos Pintér:
Variations on a theme: the power values of power sums

18:05-18:35 Michael Drmota:
Gelfond problems on the sum-of-digits function and subsequences of automatic sequences
(slides)

Éva Tardos:
Games, Auctions, Learning, and the Price of Anarchy
Lajos Hajdu:
A Hasse-type principle for exponential diophantine equations and its applications
(slides)

19:00-22:00Conference banquet - boat cruise   (map)

July 5, Friday

9:00-9:50 Tomasz Łuczak: Threshold functions: a historical overview (video, slides)
9:50-10:35Coffee break
10:35-11:25 János Pintz: Paul Erdős and the difference of primes (video, slides)
11:30-12:20 Péter Komjáth: Finite substructures of uncountable graphs and hypergraphs (video, slides)
12:20-14:00Lunch break
14:00-14:30Poster session
  Reading Room Large Lecture Hall Ceremonial Hall Small Lecture Hall Dome Hall
 Number TheoryProbabilistic MethodCombinatoricsApproximation TheorySet Theory
14:30-15:00 Imre Kátai:
Arithmetical functions with regular behaviour
(slides)
Angelika Steger:
How to learn quickly
Ervin Győri:
Hypergraph generalizations of the extremal graph theorem of Erdős and Gallai on paths
Péter Vértesi:
Paul Erdős and interpolation: Problems, results and new developments
(slides)
Gregory Cherlin:
Universal Graphs with Forbidden Subgraphs
(slides)
15:05-15:35 Krishnaswami Alladi:
Multiplicative functions and small divisors
(slides)
Nick Wormald:
A new model for analysis of the random graph d-process
Zoltán Füredi:
Turán type hypergraph problems: partial trees and linear cycles
Tamás Erdélyi:
The Mahler measure of the Rudin-Shapiro polynomials
(slides)
Norbert Sauer:
Edge labelled graphs and metric spaces
(slides)
15:40-16:10 Aleksandar Ivić:
The divisor function and divisor problem
(slides)
Oliver Riordan:
The evolution of Achlioptas processes
(slides)
András Gyárfás:
Problems and memories
(slides)
Boris Shekhtman:
Some problems and results in multivariate interpolation
(slides)
Jean Larson:
Counting G-tops
16:10-16:55Coffee break
16:55-17:25 Mihály Szalay:
Paul Erdős's results and influence in the theory of integer partitions
(slides)
Mihyun Kang:
Recent developments in phase transitions and critical phenomena: 54 years since the seminal work of Erdős and Rényi
(slides)
William Trotter:
Tree-width and dimension
(slides)
Len Bos:
Fekete Points as Norming Sets
Matthew Foreman:
Random graph techniques and banking system failures
17:30-18:00
David Conlon:
On the KŁR conjecture in random graphs
(slides)
Zsolt Tuza:
Graph coloring and covering
(slides)
Vilmos Komornik:
Expansions in noninteger bases and Pisot numbers
(slides)

18:05-18:35
Joel Spencer:
Six Standard Deviations Still Suffice
(slides)