DIMACS/DIMATIA/Renyi Working Group on Extremal Combinatorics Main Page
DIMACS/DIMATIA/Renyi Tripartite Partnership
Monday, October 18, 2004
9:00 - 9:45 Registration and Breakfast at DIMACS - CoRE Building, 4th Floor Lounge
9:45 - 10:00 Welcome and Introductory remarks
Fred Roberts, DIMACS Director
10:00 - 10:30 Co-degree Density of Hypergraphs
Yi Zhao, UIC
10:35 - 11:05 Regularity Lemmas for Hypergraphs
Mathias Schacht, Emory University
11:10 - 11:40 Break
11:40 - 12:10 Ramsey Number of Hypergraph Cycles
Jozef Skokan, UIUC
12:15 - 1:30 Lunch at DIMACS
1:30 - 2:30 Discussion Period
2:30 - 3:00 On Ramsey Number of Sparse Uniform Hypergraphs
Alexandr Kostochka, UIUC
3:05 - 3:35 Applications of the Sparse Regularity Lemma
Yoshiharu Kohayakawa, Emory University
3:40 - 4:10 Break
4:10 - 4:40 On a Problem of Erd\H{o}s and Rothschild
Benjamin Sudakov, Princeton University
4:50 - 5:30 Discussion Period
5:30 Wine and Cheese Reception
Tuesday, October 19, 2004
9:15 - 10:00 Registration and Breakfast at DIMACS - CoRE Building, 4th Floor Lounge
10:00 - 10:30 How Different can Two Intersecting Families Be?
Balázs Patkós, Rényi Institute
10:35 - 11:05 Forbidden Configurations
Attila Sali, Rényi Institute
11:10 - 11:40 Break
11:40 - 12:10 0-1 matrices and the Number of Unit Distances
János Pach, NYU
12:15 - 1:30 Lunch at DIMACS
1:30 - 2:30 Discussion Period
2:30 - 3:00 Local Chromatic Number and the Borsuk-Ulam Theorem
Gábor Simonyi, Rényi Institute
3:05 - 3:35 Back to the old LYM (=YBLM) inequality
Gyula Katona, Rényi Institute
3:40 - 4:10 Break
4:10 - 4:40 Ramsey results for 3-coloring and odd cycles
Miklós Simonovits, Rényi Institute
4:50 - 5:30 Discussion Period
5:30 Banquet at DIMACS
Wednesday, October 20, 2004
9:15 - 10:35 Registration and Breakfast at DIMACS - CoRE Building, 4th Floor Lounge
10:35 - 11:05 Erdös-Hajnal Sets and Semigroup Decompositions
Joshua Cooper, NYU postdoc
11:10 - 11:40 Break
11:40 - 12:10 Locally Consistent Constraint Satisfaction Problems
Dan Král, Charles University, DIMATIA
12:15 - 1:30 Lunch at DIMACS
1:30 - 2:00 Minimal Universal Bipartite Graphs
Gabor Rudolf, Rutgers
2:15 - 3:15 Discussion Period and Open Problems
Previous: Participation
Workshop Index