April 10
Arrival
14:00 - 14:45 Richard Anstee: Small Forbidden Configurations
14:45 - 15:10 Zsolt Katona: Multiply intersecting families of sets
15:10 - 15:25 Tea break
15:25 - 16:10 Zsolt Tuza: Coloring mixed hypergraphs
April 11 Celebrating Béla Bollobás's 60th birthday
9:30 - 10:15 Gyula O. H. Katona: Béla's families of subsets
10:15 - 11:00 Miklós Simonovits: How many graphs?
11:00 - 11:30 Coffee break
11:30 - 12:15 Zoltán Füredi: Turán type problems
12:15 - 13:00 Ervin Győri: Extremal problems related to cycles
19:00 Banquet
April 14
10:00 Norihide Tokushige The maximum size o 3-wise 2-intersecting Sperner families
10:40 Ákos Kisvölcsey: Flat Antichains
11:40 Péter L. Erdős: Splitting property and property B
12:20 Vince Grolmusz: From Ramsey-graphs to fast matrix multiplication
April 15
10:00 Gábor Tardos: Forbidden submatrices
10:40 Imre Bárány TBA
11:40 Gyula Y. Katona: m-path cover saturated graphs
12:00 Géza Tóth: How many string graphs are there?
12:30 Tamás Fleiner: On a lemma of Scarf
April 16
10:00 Annalisa De Bonis: Optimal two-stage algoriths for group testing problems
10:40 Gábor Wiener: Approximately separating systems
11:40 Stephen Hartke: The Voter model with confidence levels
12:20 Krisztián Tichler: Extremal theorems for databases
The event is supported by NSF, OTKA, and the Hungarian Academy of Sciences
Alfréd Rényi Institute of Mathematics,
Hungarian Academy of Sciences
POB 127
H-1364 Budapest, Hungary
Phone:(36 1) 483 8300
Fax: (36 1) 483 8333
Email: ddr2003@renyi.hu