DIMACS/DIMATIA/Renyi Working Group on Extremal Combinatorics

First Meeting Dates: April 10 - 16, 2003
Location: Alfred Renyi Institute, Budapest, Hungary

Organizers:
Gyula Katona, Alfred Renyi Institute, ohkatona@renyi.hu
The Rényi Institute Home Page

DIMACS/DIMATIA/Rényi on Extremal Combinatorics Main Page

DIMACS/DIMATIA/Renyi Tripartite Partnership

Workshop Program:

Thursday, April 10, 2003

 2:00  Richard Anstee: Small Forbidden Configurations
 2:45  Zsolt Katona: Multiply intersecting families of sets
 3:25  Zsolt Tuza: Coloring mixed hypergraphs

Friday, April 11, 2003

Celebrating Béla Bollobás 60th  birthday

 9:30  Gyula O. Katona: Béla's families of subsets
10:15  Miklós Simonovits: How many graphs?
11:30  Zoltán Furedi: Turán type problems
12:15  Ervin Gyori:Extremal problems related to cycles

Monday, April 14, 2003

10:00  Norihide Tokushige: The maximum size o 3-wise 2-intersecting Sperner families
10:40  Akós Kisvolesey: Flat Antichains
11:40  Péter L. Erdos: Splitting property and property B
12:20  Vince Grolmusz:From Ramsey-graphs to fast matrix multiplication

Tuesday, April 15, 2003

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

Wednesday, April 16, 2003

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
Previous: List of Participants
Working Group Index
DIMACS Homepage
Contacting the Center
Document last modified on April 14, 2004.